The streets in a particular city form a rectangular grid. The North-South streets are numbered 1st Street, 2nd Street, etc. from west to east. The West-East streets are numbered 1st Avenue, 2nd Avenue, etc. from south to north.
Martin lives at the intersection of 4th Street and 17th Avenue, and wants to jog to the intersection of 11th Street and 9th Avenue. He does not want to spend more time than necessary, so he will only run east and south.
Also, Martin wants to avoid the accident site at the crossing of 10th Street and 15rd Avenue, as well as that at 7th Street and 12th Avenue.
How many jogging routes are there for Martin to choose from?
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.
WIthout the accident sites, Martin's trip consists of 15 units, of which 7 are east and 8 south. That gives a total of ( 1 5 7 ) = 6 4 3 5 routes. We subtract the routes that include an accident site. Fortunately no valid will include both accident sites (why not?), so we can subtract them separately.
Any route to the first accident site consists of 8 units, 6 of which are east and 2 south. To complete the jog, Martin would run another 7 units, of which 1 goes east and 6 south. This accounts for ( 8 6 ) ⋅ ( 7 1 ) = 1 9 6 routes . Likewise, for the second accident site we get ( 8 3 ) ⋅ ( 7 4 ) = 1 9 6 0 routes . That leaves 6 4 3 5 − 1 9 6 − 1 9 6 0 = 4 2 7 9 routes that avoid the accident sites.