Last visit was: 15 Sep 2026, 01:38 It is currently 15 Sep 2026, 01:38
Home
Messages
Tests
Schools
Events
Close
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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
User avatar
kumar83
User avatar
Joined: 04 Jul 2013
Last visit: 22 Apr 2014
Posts: 6
Own Kudos:
44
 [28]
Given Kudos: 5
WE:Consulting (Non-Profit and Government)
Posts: 6
Kudos: 44
 [28]
Amy has to visit towns B and C in any order. The roads conne Updated on: 19 Sep 2022, 09:35
Originally posted by kumar83 on 04 Jan 2014, 23:47.
Last edited by Bunuel on 19 Sep 2022, 09:35, edited 2 times in total.
Renamed the topic and edited the question.
2
Kudos
Add Kudos
25
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
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


Show Spoiler
Attachment:
1.gif
1.gif [ 1.68 KiB | Viewed 56827 times ]
ShowHide Answer
Official Answer
B
Most Helpful Reply
User avatar
KarishmaB
User avatar
Joined: 16 Oct 2010
Last visit: 14 Sep 2026
Posts: 16,655
Own Kudos:
81,339
 [17]
Given Kudos: 492
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,655
Kudos: 81,339
 [17]
Amy has to visit towns B and C in any order. The roads conne 18 Jun 2014, 21:27
12
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
kumar83
Attachment:
1.gif

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
Show more

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
avatar
PareshGmat
avatar
Joined: 27 Dec 2012
Last visit: 10 Jul 2016
Posts: 1,531
Own Kudos:
8,439
 [5]
Given Kudos: 193
Status:The Best Or Nothing
Location: India
Concentration: General Management, Technology
WE:Information Technology (Computer Software)
Posts: 1,531
Kudos: 8,439
 [5]
Amy has to visit towns B and C in any order. The roads conne 19 Jun 2014, 02:03
4
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
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
Attachments

1.gif
1.gif [ 2.18 KiB | Viewed 50623 times ]

General Discussion
User avatar
kinjiGC
User avatar
Joined: 03 Feb 2013
Last visit: 04 Sep 2026
Posts: 787
Own Kudos:
2,761
Given Kudos: 567
Location: India
Concentration: Operations, Strategy
Schools: Tepper '17 (M$) W.P. Carey '17 (A$) NUS '17 (A)
GMAT 1: 760 Q49 V44
GPA: 3.88
WE:Engineering (Computer Software)
Products:
My Reviews
Schools: Tepper '17 (M$) W.P. Carey '17 (A$) NUS '17 (A)
GMAT 1: 760 Q49 V44
Posts: 787
Kudos: 2,761
Amy has to visit towns B and C in any order. The roads conne 05 Jan 2014, 00:23
Kudos
Add Kudos
Bookmarks
Bookmark this Post
kumar83
Source: Other - https://www.majortests.com/gmat/problem_solving_test01

Attachment:
1.gif

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
Show more

Clockwise:
Lets assume Weight of A is 1, So the weight of B is 1 as only one route is there to reach.
Weight of C = 1+1 (2 ways to reach C from B) = 2
Weight of A (the last point in the journey ) = 2 + 2 (2 ways to reach A from C) = 4

Similarly for Anti-clokwise :
Lets assume weight of A is 1, so the weight of C = 1+1 (2 ways to reach to C from A) = 2
Weight of B = 2+2 (as there are 2 ways to reach B from C) = 4
Weight to reach A = 4 (as only one way to reach A from C) = 4

hence total is 4+4 = 8 ways (option B))

For any questions on route, this is the best way to solve.
User avatar
kinjiGC
User avatar
Joined: 03 Feb 2013
Last visit: 04 Sep 2026
Posts: 787
Own Kudos:
2,761
Given Kudos: 567
Location: India
Concentration: Operations, Strategy
Schools: Tepper '17 (M$) W.P. Carey '17 (A$) NUS '17 (A)
GMAT 1: 760 Q49 V44
GPA: 3.88
WE:Engineering (Computer Software)
Products:
My Reviews
Schools: Tepper '17 (M$) W.P. Carey '17 (A$) NUS '17 (A)
GMAT 1: 760 Q49 V44
Posts: 787
Kudos: 2,761
Amy has to visit towns B and C in any order. The roads conne 05 Jan 2014, 00:32
Kudos
Add Kudos
Bookmarks
Bookmark this Post
To make the concept a little more clear, I have just added a example which is attach.

How many ways a person can reach from A to I if only direction allowed to traverse is from left to right?


Weight of A = 1
Weight of B = 1
weight of C = 1
Weight of D = 1
weight of E = 1+1 = 2
weight of F =1
weight of G = 1
weight of H = 1+ 2 + 1 = 4
weight of I = 1 + 4 + 1 = 6

so 6 ways are possible.

The questions can be made a little more complex as there might be a circular path to a node or in one of the path back traversal is allowed (only once for example), then the weights can be calculated again. This method takes care of double counting and with practice, it can be done in secs.
One of my Quant teacher used to say "Clicking the option takes more time than to solve the question". :)
Attachments

File comment: Sample problem in Routes
RouteMapSampleProblems.png
RouteMapSampleProblems.png [ 16.6 KiB | Viewed 50043 times ]

User avatar
maggie27
User avatar
Joined: 25 Apr 2014
Last visit: 19 May 2015
Posts: 75
Own Kudos:
381
 [1]
Given Kudos: 1,474
Posts: 75
Kudos: 381
 [1]
Amy has to visit towns B and C in any order. The roads conne 19 Jun 2014, 06:26
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks Paresh and Karishma .Kudos to u both :)
avatar
Rca
avatar
Joined: 12 Dec 2013
Last visit: 11 May 2015
Posts: 11
Own Kudos:
14
Given Kudos: 34
Posts: 11
Kudos: 14
Amy has to visit towns B and C in any order. The roads conne 05 Nov 2014, 02:02
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks Karishma for a simple explanation. +1 to you!
User avatar
Kinshook
User avatar
Major Poster
Joined: 03 Jun 2019
Last visit: 14 Sep 2026
Posts: 6,129
Own Kudos:
6,104
Given Kudos: 164
Location: India
Schools: HBS '28 CBS '26 Wharton '26
GMAT 1: 690 Q50 V34
WE:Engineering (Transportation)
Products:
My Reviews
Schools: HBS '28 CBS '26 Wharton '26
GMAT 1: 690 Q50 V34
Posts: 6,129
Kudos: 6,104
Amy has to visit towns B and C in any order. The roads conne 06 Jun 2022, 10:59
Kudos
Add Kudos
Bookmarks
Bookmark this Post
[quote="kumar83"]
Attachment:
1.gif

Given: Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram.
Asked: 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?

Number of ways to visit B from A = 2
Number of ways to visit C from B = 2
Number of ways to visit A from C = 2 (There are 3 ways out of which 1 is already used for B-C movement)

Total number of ways = 2*2*2 = 8

IMO B
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 39,229
Own Kudos:
1,159
Posts: 39,229
Kudos: 1,159
Amy has to visit towns B and C in any order. The roads conne 17 Feb 2025, 09:51
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderator:
Bunuel
Math Expert
113520 posts