Fast method to solve this Pascal's Triangle question

102 Views Asked by At

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

1

There are 1 best solutions below

1
On BEST ANSWER

You can simply add components from left or below:

[pascalwithgaps

Answer: $145$