Trying to find how many different paths from point A to point B

I have a 3X4 grid and point A is at (0,0) and point B is at (4,3). I can only go one step up or one step to the right at each move to make it from point A to point B. How many different paths from A to B are possible? I must take 4 steps to the right and 3 steps upward.

Re: Trying to find how many different paths from point A to point B

Quote:

Originally Posted by

**ssmero01** I have a 3X4 grid and point A is at (0,0) and point B is at (4,3). I can only go one step up or one step to the right at each move to make it from point A to point B. How many different paths from A to B are possible? I must take 4 steps to the right and 3 steps upward.

How many ways are there to arrange the string