BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

Pavel has to visit his aunt, who lives exactly eight blocks north and six blocks

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Moderator
Posts: 7187
Joined: Thu Sep 07, 2017 4:43 pmFollowed by: 23 members
by BTGmoderatorDC » Sat Aug 27, 2022 2:32 am

Timer

00:00

Answers

A

B

C

D

E

Stats

Difficulty—

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
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pmFollowed by: 1268 members
Location: Vancouver, BC
Thanked: 5254 times
GMAT Score:770

Re: Pavel has to visit his aunt, who lives exactly eight blocks north and six blocks

by Brent@GMATPrepNow » Sun Aug 28, 2022 9:24 am
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
Image
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 8154
Joined: Sat Apr 25, 2015 10:56 amFollowed by: 29 members
Location: Los Angeles, CA
Thanked: 43 times

Re: Pavel has to visit his aunt, who lives exactly eight blocks north and six blocks

by Scott@TargetTestPrep » Thu Jan 12, 2023 6:05 pm
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

Let N be a “north” block (i.e., when Pavel travels north) and E be an “east” block (i.e., when he travels east). Thus, one path Pavel can go to his aunt’s house is NNNNNNNNEEEEEE and the total number of paths is 14! / (8!6!) (i.e., the number of ways one can arrange 8 N’s and 6 E’s in NNNNNNNNEEEEEE).

Answer: B

Scott Woodbury-Stewart
Founder and CEO
[email protected]

Image

See why Target Test Prep is rated 5 out of 5 stars on BEAT the GMAT. Read our reviews

ImageImage
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1