Stage: 4 Challenge Level: 
There are three ways to enter the triangular array of numbers in the diagram below, starting with 1, and counting from 1 -2 in order, finishing with the two in the bottom row.
How many ways are there to count 1 - 2 - 3 in the following array?
And 1 - 2- 3 - 4 on this?
Can you generalize?
Can you explain what you find?
Surds. Networks/Graph Theory. Codes and cryptography. alphas. Stage 5 - Reviewed 2012. Algorithms. Combinatorics. Mathematical reasoning & proof. Working systematically. Powers & roots.
Published July 2004,August 2004.
Copyright © 2007. University of Cambridge. All rights reserved.
NRICH is part of the family of activities in the Millennium Mathematics Project, which also includes the Plus and Motivate sites.
email: nrich@damtp.cam.ac.uk