David’s house is at the corner of 9th Avenue and 14th Street. Every morning he walks to the school which is located at the corner of 2nd Avenue and 17th Street. He wants to take the shortest path to school, but a different path each day. For example, one day he walked 3 blocks north and 7 blocks east, and on another day, he walked 2 blocks east, 2 blocks north, 5 blocks east, and 1 block north. How many different shortest paths are possible?
(Due May 30, 2008)
1 comment:
David can go to school by taking the following paths:
NNNEEEEEEE
NNEEEEEENE
NEEEEENENE
EEEEEEENNN
ENENENEEEE
ENNENEEEEE
and so on.
This problem has to do with arranging 3 N's and 7 E's.
Post a Comment