A tennis court is built in Willy's town, with vertices at \( (6,6), (9,6), (9,10), (6,10) \). 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 \( (10,12) \), how many ways are there for Willy to walk to school? Let this number be \(n\). Compute \(\frac{4}{3}n\).

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.

×

Problem Loading...

Note Loading...

Set Loading...