1 1 1 1
1 2 3 4
1 3 6 10
Ok this is kind of tough to explain. It's an EC problem but i have no idea where to start, should I find a pattern?
There is a checkerboard that is 60 squares in length by 58 squares in width.
You want to travel from the top left corner to the bottem right corner. But you can only move down or right.
How many paths can you take?
Heres an example of a possible path if the board was smaller and perfectly square. As you can see you can only move right or down.
This is a classic problem and solved many times in the forum.
These threads will help you:
ok the pascals triangle thing helps me, but how can I solve it for 58 by 60 squares without writing everything out?
I got this off of wikipedia but i dont know if it is relevant or where to plug the numbers in
""This construction is related to the binomial coefficients by Pascal's rule, which states that if
is the kth binomial coefficient in the binomial expansion of (x + y)n, where n! is the factorial of n, then
for any nonnegative integer n and any integer k between 0 and n.""