How to solve this issue?

This topic has expert replies
Source: — Problem Solving |

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 16207
Joined: Mon Dec 08, 2008 6:26 pm
Location: Vancouver, BC
Thanked: 5254 times
Followed by:1268 members
GMAT Score:770

by Brent@GMATPrepNow » Mon Apr 22, 2013 6:15 am
The fastest way (for me) is to just count up the squares that require mileages.

Image

We get [spoiler]15 = A[/spoiler]

Cheers,
Brent
Brent Hanneson - Creator of GMATPrepNow.com
Image

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 511
Joined: Wed Aug 11, 2010 9:47 am
Location: Delhi, India
Thanked: 344 times
Followed by:86 members

by Anju@Gurome » Mon Apr 22, 2013 10:55 am
Basically the problem is asking how many distinct pairs of cities we can make.
Number of such pairs = number of ways to select 2 cities from 6 = 6C2 = 6*5/2 = 15
Anju Agarwal
Quant Expert, Gurome

Backup Methods : General guide on plugging, estimation etc.
Wavy Curve Method : Solving complex inequalities in a matter of seconds.

§ GMAT with Gurome § Admissions with Gurome § Career Advising with Gurome §

Junior | Next Rank: 30 Posts
Posts: 18
Joined: Thu Apr 11, 2013 8:53 am

by btgsnt » Tue Apr 23, 2013 7:37 am
Thank you both