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

Redeem

How many ways from A to D

Expert replies
by maihuna » Tue Dec 08, 2009 6:03 am
There are bidirectional links from cities A to F in following way. Each city have connection to two cities. How many total connections are there.

Provide youw own answer.
Charged up again to beat the beast :)
Join the discussion
Source: — Problem Solving |

by sunil_snath » Tue Dec 08, 2009 8:54 am
Assuming cities are a, b,c,d,e,f, they will form a circlular connection.

So, 6 bidirectional links or 12 one directional links.
Join the discussion

by maihuna » Tue Dec 08, 2009 10:02 am
sunil_snath wrote:Assuming cities are a, b,c,d,e,f, they will form a circlular connection.

So, 6 bidirectional links or 12 one directional links.
I am not saying circular, by bidirectional I mean if there is a way from A to B it is also from B to A, and by two links from A I mean to two different cities let us say B and C. Hope I am clear.
Charged up again to beat the beast :)
Join the discussion

by sunil_snath » Wed Dec 09, 2009 12:33 am
so heres how that will map out:


B -------C ------- D
! !
! !
A--------E---------F

If every city is connected to the other 2, they will form a circle (or square or something like that... :) lol). But then they will have 6 bi directional conections.

Cmon Maihuna, help me out of my misery here, tell me the answer... :)
Join the discussion

by munaf » Wed Dec 09, 2009 12:52 am
IS THE ANSWER 6?
Join the discussion

by maihuna » Wed Dec 09, 2009 5:11 am
sunil_snath wrote:so heres how that will map out:


B -------C ------- D
! !
! !
A--------E---------F

If every city is connected to the other 2, they will form a circle (or square or something like that... :) lol). But then they will have 6 bi directional conections.

Cmon Maihuna, help me out of my misery here, tell me the answer... :)
Ok, let me just recheck it.
Charged up again to beat the beast :)
Join the discussion