BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

twice on the same trip

Expert replies
by sanju09 » Fri Jul 23, 2010 2:04 am
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

[spoiler]Source: majortests.com[/spoiler]
Attachments
amivisits.gif
The mind is everything. What you think you become. -Lord Buddha



Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001

www.manyagroup.com
Join the discussion
Source: — Problem Solving |

by outreach » Fri Jul 23, 2010 2:09 am
route no of ways
A - C =2
A -B =1
C - B =2

total =4
-------------------------------------
--------------------------------------
General blog
https://amarnaik.wordpress.com
MBA blog
https://amarrnaik.blocked/
Join the discussion

by selango » Fri Jul 23, 2010 2:17 am
8 ways
--Anand--
Join the discussion