is there a really fast way of solving PS problem #195 from OG 11ed ?
pat walks from intersection X to intersection Y problem ?
Thnx,
-Badri
pat walks from intersection X to intersection Y problem ?
Thnx,
-Badri
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
Redeem
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
og 11ed problem
Source: Beat The GMAT — Problem Solving |
No one is going to look up the question to help you. If you want help, at least be active enough to type out the question.
-
givemeanid
- Master | Next Rank: 500 Posts
- Posts: 277
- Location: New York, NY
- Thanked: 6 times
Yeah. And do not even get me started on ones who post screen shots for problems with plain text...
So It Goes
sorry folks. the problem had a figure which I couldn't draw very easily. Hence the pointer to the problem.
Will write up the whole problem and try to draw the figure once I get home tonight.
-B
P.S. From what I remember-
imagine a 1st quadrant grid. How many different shortest paths are possible from (0,0) to (3,4) travelling only along the grid lines (going from y=0 to y=4, x=0 to x=3
I'll confirm this evening.
Will write up the whole problem and try to draw the figure once I get home tonight.
-B
P.S. From what I remember-
imagine a 1st quadrant grid. How many different shortest paths are possible from (0,0) to (3,4) travelling only along the grid lines (going from y=0 to y=4, x=0 to x=3
I'll confirm this evening.
I remember this question... I believe the answer was 10?
By taking the shortest route possible, he can only travel Up (U) three or Right (R) two.
The combinations are:
UUURR
UURRU
URRUU
RRUUU
UURUR
URURU
RURUU
URUUR
RUURU
RUUUR
In other words:
5!/3!*2!
By taking the shortest route possible, he can only travel Up (U) three or Right (R) two.
The combinations are:
UUURR
UURRU
URRUU
RRUUU
UURUR
URURU
RURUU
URUUR
RUURU
RUUUR
In other words:
5!/3!*2!
The combinatoric way to solve this question is the "anagram approach". In other words, how many words can you make with a set of letters via rearranging the letters. The way to figure this out is:
(Total number of letters)! / (Number of each repeating letter)!
Here, the total number of letters is 5, there are 2 repeating R's and 3 repeating U's.
(Total number of letters)! / (Number of each repeating letter)!
Here, the total number of letters is 5, there are 2 repeating R's and 3 repeating U's.
