BTGmoderatorDC wrote: ↑Sat Aug 27, 2022 2:32 am
Pavel has to visit his aunt, who lives exactly eight blocks north and six blocks east of his current location. If Pavel travels only along streets and does not travel diagonally, the shortest possible route connecting the two points is exactly 14 blocks. How many different 14-block routes may Pavel take to travel the shortest possible distance to his aunt’s house?
A. 14
B. (14!)/(8!6!)
C. (22!)/(14!8!)
D. 8!6!
E. 14!8!6!
OA
B
Source: Veritas Prep
Pavel's route will consist of 14 steps (Norths and Easts).
6 of those steps will be Easts and the rest will be Norths.
So, let's select the 6 steps that will be Easts and let the rest be Norths.
In how many ways can we select 6 of the 14 steps?
Well, since the order
in which we select the steps does not matter, we can use combinations.
So, we can select the 6 steps in 14C6 ways.
14C6 = 14!/(8!6!)
Answer: B
Brent Hanneson - Creator of GMATPrepNow.com
