Events & Promotions
|
|
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Apr 1612:00 PM EDT
-11:59 PM EDT
You’re first to know: Save $200 on GMAT prep starting tomorrow, 4/13. Get 6 official practice tests and study with real questions. Be ready to save!
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
02 Jul 2021, 06:15
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
55%
(hard)
Question Stats:
57% (01:13) correct
43%
(01:55)
wrong
based on 608
sessions
History
Date
Time
Result
Not Attempted Yet
A man walks to his home from his current location on the rectangular grid shown. If he may choose to walk north or east at any corner, but may never move south or west, how many different paths can the man take to get home?
(A) 12
(B) 24
(C) 32
(D) 35
(E) 64
Attachment:
2021-06-17_23-29-08.png [ 19.97 KiB | Viewed 11718 times ]
02 Jul 2021, 06:29
Kudos
Bookmarks
Bunuel
Allowed movements
North and East
CONCEPT:
Number of ways to reach from one point to other in a grid = \(^{(H+V)}C_H\) OR \(^{H+V}C_V\)
where,
V = Total number of Vertical Paths to reach from A to B
H = Total number of Horizontal Paths to reach from A to B
Number of ways to reach from one point to other in a grid = \(^{(H+V)}C_H\) OR \(^{H+V}C_V\)
where,
V = Total number of Vertical Paths to reach from A to B
H = Total number of Horizontal Paths to reach from A to B
Here, V = 3
and, H = 4
Number of ways to reach from one point to other in a grid = \(^{(4+3)}C_4\) OR \(^{(4+3)}C_3\) \(= \frac{7!}{3!*4!} = 35\)
Answer: Option D
Check Similar Official Question and explanation for this formula here
General Discussion
12 Jul 2021, 07:21
Kudos
Bookmarks
The man has to move North 3 times and East 4 times for a total of 7 decisions.
These can be arranged in any sequence, that is 7! ways.
However, there is no difference between any of the North decisions inter-se and same for East decisions as well.
Hence, we have to divide the equation by 4! and 3!.
Answer = 7!/3!4! = 35 ways.
Answer - D
These can be arranged in any sequence, that is 7! ways.
However, there is no difference between any of the North decisions inter-se and same for East decisions as well.
Hence, we have to divide the equation by 4! and 3!.
Answer = 7!/3!4! = 35 ways.
Answer - D
