Please check the attachment for the figure.
In how many ways, can a person go from point A to point B if he or she could only move down or right?
My answer is 9!/(5!4!).
Please let me know if I am right or wrong? And correct method too?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityPlease check the attachment for the figure.
In how many ways, can a person go from point A to point B if he or she could only move down or right?
My answer is 9!/(5!4!).
Please let me know if I am right or wrong? And correct method too?
This diagram should make it clear that there are $29$ paths. \begin{array}{rrrrrrrrr} \text{A}&\rightarrow&1&\rightarrow&1\\ \ \downarrow&&\ \downarrow&&\ \downarrow\\ 1&\rightarrow&2&\rightarrow&3\\ &&\ \downarrow&&\ \downarrow\\ &&2&\rightarrow&5\\ &&\ \downarrow&&\ \downarrow\\ &&2&\rightarrow&7\\ &&\ \downarrow&&\ \downarrow\\ &&2&\rightarrow&9&\rightarrow&9&\rightarrow&9\\ &&\ \downarrow&&\ \downarrow&&\ \downarrow&&\ \downarrow\\ &&2&\rightarrow&11&\rightarrow&20&\rightarrow&\text{B} \end{array}
How many ways from A to B in the figure below?
Now in your picture, are there more ways, fewer, or the same number of ways? Does this picture have paths that yours does not? Does your picture have paths that this one does not?
The general formula when you go from one corner of a rectangular grid to the diagonally opposite corner is $\binom{W+H}{W} = \frac{(W+H)!}{W!H!}.$ If you delete some of the lines in the grid, you lose the paths that go on those lines, and you need to do something more complicated to count the paths. Usually this will involve multiple cases, perhaps even inclusion-exclusion.