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
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
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 and his walk - formula based?

Expert replies
by bhumika.k.shah » Fri Feb 05, 2010 7:08 am
191. 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

Is it possible to solve this sum by some formula ?
Join the discussion
Source: — Problem Solving |

by ajith » Fri Feb 05, 2010 7:11 am
bhumika.k.shah wrote:191. 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

Is it possible to solve this sum by some formula ?
Please provide the "Map above"
Always borrow money from a pessimist, he doesn't expect to be paid back.
Join the discussion

by bhumika.k.shah » Fri Feb 05, 2010 7:16 am
Please find the same attached.
Attachments
map.doc
(32.5 KiB) Downloaded 190 times
Join the discussion

by ajith » Fri Feb 05, 2010 7:24 am
bhumika.k.shah wrote:Please find the same attached.
The destination is 3up and 2 Left from the current place

Now its a matter of arranging 3Us and 2Ls

5!/3!*2! = 120/6*12 =10
Always borrow money from a pessimist, he doesn't expect to be paid back.
Join the discussion

by bhumika.k.shah » Fri Feb 05, 2010 7:26 am
got it till the highlighted part.

next is what???
ajith wrote:
bhumika.k.shah wrote:Please find the same attached.
The destination is 3up and 2 Left from the current place

Now its a matter of arranging 3Us and 2Ls

5!/3!*2! = 120/6*12 =10
Join the discussion

by ajith » Fri Feb 05, 2010 7:39 am
bhumika.k.shah wrote:got it till the highlighted part.

next is what???
ajith wrote:
bhumika.k.shah wrote:Please find the same attached.
The destination is 3up and 2 Left from the current place

Now its a matter of arranging 3Us and 2Ls

5!/3!*2! = 120/6*12 =10
There is nothing left - we're done

Each of the arrangement is one solution to the problem
For example UUULL is one ULULU is another ULLUU is another .... so and so forth we have 10 solutions which takes only 5 steps to reach the destination. (ULULU means 1 unit up then 1 unit left then 1 up, then 1 left and final up)

So 10 aka C is the answer.
Always borrow money from a pessimist, he doesn't expect to be paid back.
Join the discussion

by okletsdothis » Sun Oct 03, 2010 7:03 am
I am a little weak in permutation. Could you explain how u came to 5!/3!*2! = 120/6*12 =10

thnks
Join the discussion

by saurabhmahajan » Mon Oct 04, 2010 3:46 am
okletsdothis LETS DO THIS :-)

we have to cross total 5 lines in grid to reach from X to Y. so 5!
but then we can choose 3 streets out of 4 and 2 avenues out 3 to get there. (even if you choose any way you will have to cross 3 streets and 2 avenues). so 3!.2!


hope you got it....if not we can do this again :-)
Thanks and regards,
Saurabh Mahajan

I can understand you not winning,but i will not forgive you for not trying.
Join the discussion

by okletsdothis » Mon Oct 04, 2010 6:47 am
Hi Saurabh,

thnkx for replying but i still did not understand. So i searched a bit and in one of the posts Stuart has replied.

https://www.beatthegmat.com/pat-walking- ... 49172.html

Check it out. He really takes the point hope especially with his examples.

best of luck!!


-okletsdothis !!
Join the discussion

by GMATGuruNY » Mon Oct 04, 2010 7:40 am
bhumika.k.shah wrote:got it till the highlighted part.

next is what???
ajith wrote:
bhumika.k.shah wrote:Please find the same attached.
The destination is 3up and 2 Left from the current place

Now its a matter of arranging 3Us and 2Ls

5!/3!*2! = 120/6*12 =10
Whenever an element is repeated in a permutation, we have to divide by (number of repetitions)!.

For example:

The number of ways to arrange the letters in the word SPEED is 5!/2! = 60. We divide by 2! to account for the 2 E's.

The number of ways to arrange the letters in the word RADAR is 5!/(2!*2!) = 30. We divide by 2! to account for the 2 A's and by another 2! to account for the 2 R's.

The number of ways to arrange the letters in the word MISSISSIPPI = 11!/(4!*4!*2!). We divide by 4! to account for the 4 S's, by another 4! to account for the 4 I's, and by 2! to account for the 2 P's.

In the problem above, we have to make 2 movements east and 3 movements north: EENNN. Any arrangement of the letters EENNN will yield a possible route.

Number of ways to arrange EENNN = 5!/(2!*3!) = 10.
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

by noyj91 » Thu Feb 16, 2012 8:28 pm
GMATGuruNY,


thanks alot for breaking that down!
Join the discussion