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 →

Pat has to walk..

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
Senior | Next Rank: 100 Posts
Posts: 35
Joined: Sun Jul 31, 2011 9:39 pmFollowed by: 1 member
Thanked: 2 times
by Elena89 » Tue Dec 13, 2011 5:57 am
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?
Attachments
combinatorics.JPG
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
User avatar
Legendary Member
Posts: 504
Joined: Tue Apr 19, 2011 1:40 pmFollowed by: 11 members
Thanked: 114 times

by knight247 » Tue Dec 13, 2011 6:35 am
Hey Elena
All the streets and avenues are of equal length hence any route he takes will be of equal length. Its best to use the anagram method for such grid problems.

Suppose he decides the take the extreme route along the outer boundary of the grid...He has to walk
East East and then North North North. Try any random combination by urself and u'll find that every combo has two Easts and 3 Norths. So we have EENNN for short. Which can be permuted in 5!/(3!2!)=
10 Ways Hence C
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pmFollowed by: 1906 members
Location: New York, NY
Thanked: 13060 times
GMAT Score:790

by GMATGuruNY » Tue Dec 13, 2011 6:46 am
Elena89 wrote: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?
I posted a solution here:

https://www.beatthegmat.com/pat-and-his- ... cityevent=

Two similar problems:

https://www.beatthegmat.com/combinatroni ... 68412.html

https://www.beatthegmat.com/different-routes-t93698.html
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1