ChessWriter wrote:
116. Each "¢ in the mileage table above represents an entry
indicating the distance between a pair of the �ve
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
This is a question from the Official guide 12, Question number 116, Page number 223
The Official answer is [spoiler](B)435[/spoiler]
Every PAIR of cities is represented by a dot.
Thus, the total number of dots is equal to the total number of pairs that can be formed from the 30 cities.
The number of combinations of 2 that can formed from 30 choices = (30*29)/(2*1) = 435.
The correct answer is
B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.
As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.
For more information, please email me (Mitch Hunt) at
[email protected].
Student Review #1
Student Review #2
Student Review #3