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

Redeem

How many ways from A to D

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Legendary Member
Posts: 1578
Joined: Sun Dec 28, 2008 1:49 am
Thanked: 82 times
Followed by:9 members
GMAT Score:720

How many ways from A to D

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 :)
Top
Source: — Problem Solving |
Senior | Next Rank: 100 Posts
Posts: 39
Joined: Wed Nov 18, 2009 8:41 am
Thanked: 3 times

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.
Top
Legendary Member
Posts: 1578
Joined: Sun Dec 28, 2008 1:49 am
Thanked: 82 times
Followed by:9 members
GMAT Score:720

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 :)
Top
Senior | Next Rank: 100 Posts
Posts: 39
Joined: Wed Nov 18, 2009 8:41 am
Thanked: 3 times

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... :)
Top
Junior | Next Rank: 30 Posts
Posts: 23
Joined: Mon Nov 16, 2009 12:51 am

by munaf » Wed Dec 09, 2009 12:52 am
IS THE ANSWER 6?
Top
Legendary Member
Posts: 1578
Joined: Sun Dec 28, 2008 1:49 am
Thanked: 82 times
Followed by:9 members
GMAT Score:720

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 :)
Top
Post new topic Post Reply
• Page 1 of 1