Scenario
"In our Mathematics Circle we diagrammed 16 blocks of our city. How many different routes can we draw from
A
to
C
moving only upward and to the right?"
Different routes may, of course, have portions that coincide (as in the diagram).
"This problem is not easy. Have we solved it by counting 70 different routes?"
What answer should we give these students?
Additional content on this page is available only to members of NCTM. Please log in above or click below to join now.
Join Now
Source
Puzzle provided by Kordemsky: The Moscow Puzzles (Dover)