|
|
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.
18 Feb 2025, 13:17
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
35%
(medium)
Question Stats:
69% (01:29) correct
31%
(02:04)
wrong
based on 78
sessions
History
Date
Time
Result
Not Attempted Yet
In a video game, a player is faced with the task of moving from point A to point B to point C, and then returning from point C to point A through point B, without retracing any path. There are 5 paths from point A to point B, and 8 paths from point B to point C. In how many different ways can the player accomplish the task?
(A) 2,240
(B) 1,600
(C) 1,120
(D) 68
(E) 24
(A) 2,240
(B) 1,600
(C) 1,120
(D) 68
(E) 24
18 Feb 2025, 21:46
Kudos
Bookmarks
Moving from A to B we have 5 distinct paths and from B to C we have 8 distinct paths . Hence , we have a total of 5*8= 40 distinct paths moving from A to C via B.
We are given, retracing same path is not allowed 🚫- which results in one path being removed from A to B and B to C. Leaving 4 and 7 paths respectively. . Therefore, 7*4=28 paths.
Total = 40*28 = 1120. Option C
We are given, retracing same path is not allowed 🚫- which results in one path being removed from A to B and B to C. Leaving 4 and 7 paths respectively. . Therefore, 7*4=28 paths.
Total = 40*28 = 1120. Option C
