hemant_rajput wrote:four cities are connected by a road network as shown below in the figures. In how many ways can you start from one city and come back to it without traveling on the same road more than one?
a.14
b.12
c.15
d.10
e.16
PS: It is not an official GMAT question, also I know how to solve it, however, I was curious about the approaches to solve this problem with min. time.
Start at B.
Number of options for the first city visited = 3. (A, D or C).
Number of options for the second city visited = 2. (Either of the 2 cities not yet visited.)
Number of ways to return to B = 2. (Either directly back to B or to the one city not yet visited and then directly back to B.)
To combine these options, we multiply:
3*2*2 = 12.
The correct answer is
B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at
[email protected].
Student Review #1
Student Review #2
Student Review #3
