- Elena89
- Senior | Next Rank: 100 Posts
- Posts: 35
- Joined: Sun Jul 31, 2011 9:39 pm
- Thanked: 2 times
- Followed by:1 members
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
[spoiler]OA: C[/spoiler]
Source: OG-12
Can anyone suggest an easy way to solve this problem and others of such kind?
(A) 6
(B) 8
(C) 10
(D) 14
(E) 16
[spoiler]OA: C[/spoiler]
Source: OG-12
Can anyone suggest an easy way to solve this problem and others of such kind?
- Attachments
-












