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

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions
Start free 5-day trial
Read 559 reviewsTarget Test Prep

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

OG12: Mileage table

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
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 134 times
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
User avatar
Master | Next Rank: 500 Posts
Posts: 142
Joined: Sat Feb 20, 2010 7:23 pmFollowed by: 1 member
Thanked: 8 times

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
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Master | Next Rank: 500 Posts
Posts: 435
Joined: Mon Mar 15, 2010 6:15 amFollowed by: 1 member
Thanked: 32 times

by eaakbari » Thu Apr 01, 2010 9:04 pm
IMO D
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Master | Next Rank: 500 Posts
Posts: 435
Joined: Mon Mar 15, 2010 6:15 amFollowed by: 1 member
Thanked: 32 times

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
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1