2

I am studying for TMSCA, a timed math test, and would like to solve the following question in under a minute. Is there any shortcut method? Any help would be appreciated.

The question: Moving only to the right or upwards, how many paths are there from A to B?

The problem

JMP
  • 21,771
Andy Johnson
  • 137

1 Answers1

2

You can simply add components from left or below:

[pascalwithgaps

Answer: $145$

JMP
  • 21,771
  • This is usually the first method taught to deal with such situations, and then binomial coefficients are introduced to try to generalize the result. When several segments are removed (without any apparent order to them) like in this example, this approach is often the best (most time efficient) way to deal with it. – Calvin Lin May 02 '20 at 17:01