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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Pat has to walk..

Expert replies
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
Join the discussion
Source: — Problem Solving |

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
Join the discussion

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
Join the discussion