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

Redeem

OG12: Mileage table

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Senior | Next Rank: 100 Posts
Posts: 75
Joined: Tue Feb 10, 2009 11:30 pm

OG12: Mileage table

by nhai2003 » Sun Sep 13, 2009 2:11 am
Each . in the mileage table above represents an entry indicating the distance between a pair of the five cities. If the table were extended to represent the distances between all pairs of 30 cities and each distance were to be represented by only one entry, how many entries would the table then have?

(A) 60
(B) 435
(C) 450
(D) 465
(E) 900

Can someone shed some light on this problem?
Thanks
Attachments
City A.doc
(28 KiB) Downloaded 130 times
Top
Source: — Problem Solving |
User avatar
Master | Next Rank: 500 Posts
Posts: 142
Joined: Sat Feb 20, 2010 7:23 pm
Thanked: 8 times
Followed by:1 members

by bpgen » Thu Apr 01, 2010 8:33 pm
take total combination of 2 cities out of 30 cities, i.e 30C2=>30*29/2=>435
"Ambition is the path to success. Persistence is the vehicle you arrive in."
Top
User avatar
Master | Next Rank: 500 Posts
Posts: 435
Joined: Mon Mar 15, 2010 6:15 am
Thanked: 32 times
Followed by:1 members

by eaakbari » Thu Apr 01, 2010 9:04 pm
IMO D
Top
User avatar
Master | Next Rank: 500 Posts
Posts: 435
Joined: Mon Mar 15, 2010 6:15 am
Thanked: 32 times
Followed by:1 members

by eaakbari » Thu Apr 01, 2010 9:13 pm
My method may be a little convoluted, so have patience

In the table since only entries on one side of the diagonal will matter (as the distances are to be stated once).
If you notice it forms an A.P witch first term as 1 (from city one) and common difference one and last term 30 (from city 30)

Sum = n(a + l)/2
= 15(31)
=465


Hence D
Top
Post new topic Post Reply
• Page 1 of 1