A tennis court is built in Willy's town, with vertices at . Willy is told that he is allowed to cut across the tennis court on his way to school, so he will always do so.
With Willy's house still at the origin and his school at , how many ways are there for Willy to walk to school? Let this number be . Compute .
Assume that Willy only walks right and up, and that there is only one way to cut across the tennis court.
(See here for details.)
Apologies to all - I messed up at first.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let O = ( 0 , 0 ) , A = ( 6 , 6 ) , B = ( 9 , 1 0 ) , and S = ( 1 0 , 1 2 ) . Willy always cuts across the tennis field, which means that he must first arrive at A from O . His path to A must be some combination of 6 moves up and 6 moves to the right. The number of these combinations is given by ( 6 1 2 ) = 9 2 4 . There is only 1 way he can cut across the field, meaning he must end up at B . From B , Willy must make some combination of 2 moves up and 1 move to the right in order to get to S . The number of these combinations is ( 2 3 ) = 3 . The total number of ways for Willy to get from his house to S is therefore n = 9 2 4 ∗ 1 ∗ 3 = 2 7 7 2 . And finally, 3 4 n = 3 6 9 6 .