Hosted by The Math Forum

Problem of the Week 819

Taxi!

Fall 96 Archive || MacPOW Home || Math Forum POWs || Search MacPOW

Consider the plane grid consisting of all vertical and horizontal lines in the plane lattice. There are many paths along these "streets" that are 20 units long and connect (0, 0) to (10, 10). How many paths of length 20 from (0, 0) to (10, 10) pass through (7, 1) and go through only intersections (i, j) with j < i (except for the two endpoints).

Source: Leo Schneider

© Copyright 1996 Stan Wagon. Reproduced with permission.

[Privacy Policy] [Terms of Use]

Home || The Math Library || Quick Reference || Search || Help 

© 1994-2008 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel School of Education.