|
|
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.
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
65%
(hard)
Question Stats:
54% (01:49) correct
46%
(01:52)
wrong
based on 347
sessions
History
Date
Time
Result
Not Attempted Yet
Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram. How many different routes can she take starting from A and returning to A, going through both B and C (but not more than once through each) and not travelling any road twice on the same trip?
A. 10
B. 8
C. 6
D. 4
E. 2
Source: Other - https://www.majortests.com/gmat/problem_solving_test01
Attachment:
1.gif [ 1.68 KiB | Viewed 56592 times ]
18 Jun 2014, 21:27
Kudos
Bookmarks
kumar83
From A, there are two things Amy can do - go to B or to C. Since the paths are not symmetrical along B and C, you will need to consider them separately.
Case 1: Go to B first
A to B - 1 way
B to C - 2 ways
C to A - 2 ways
Total number of ways in this case = 1*2*2 = 4
Case 2: Go to C first
A to C - 2 ways
C to B - 2 ways
B to A - 1 way
Total number of ways in this case = 2*2*1 = 4
Total number of ways = 4+4 = 8
19 Jun 2014, 02:03
Kudos
Bookmarks
Refer diagram below:
Possible combinations via route A - B - C - A = 4
a - b1 - c1
a - b1 - c2
a - b2 - c1
a - b2 - c2
Possible combinations via route A - C - B - A = 4
Total = 8
Answer = B
Possible combinations via route A - B - C - A = 4
a - b1 - c1
a - b1 - c2
a - b2 - c1
a - b2 - c2
Possible combinations via route A - C - B - A = 4
Total = 8
Answer = B
Attachments
1.gif [ 2.18 KiB | Viewed 50389 times ]
