Pat will walk from Intersection X to Intersection Y
along a route that is confined to the square grid of
four streets and three avenues shown in the map
above. How many routes from X to Y can Pat take
that have the minimum possible length?
(A) 6
(B) 8
(C) 10
(D) 14
(E) 16
Refer page 179 for diagram. Can the answer be arrived with a formula or a combinations strategy rather than counting? Please help.
along a route that is confined to the square grid of
four streets and three avenues shown in the map
above. How many routes from X to Y can Pat take
that have the minimum possible length?
(A) 6
(B) 8
(C) 10
(D) 14
(E) 16
Refer page 179 for diagram. Can the answer be arrived with a formula or a combinations strategy rather than counting? Please help.
