GRE Prep Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Each • in the mileage table above represents
[#permalink]
27 Aug 2020, 10:07
27 Aug 2020, 10:07
Expert Reply
3
Bookmarks
00:00
Question Stats:
70% (01:59) correct
30% (02:03) wrong based on 20 sessions
Hide Show timer Statistics
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
Re: Each • in the mileage table above represents
[#permalink]
27 Aug 2020, 10:08
27 Aug 2020, 10:08
Expert Reply
Post A Detailed Correct Solution For The Above Questions And Get A Kudos.
Question From Our New Project: GRE Quant Challenge Questions Daily - NEW EDITION!
For more theory and practice see our GRE - Math Book
Question From Our New Project: GRE Quant Challenge Questions Daily - NEW EDITION!
For more theory and practice see our GRE - Math Book
Retired Moderator
Joined: 10 Apr 2015
Posts: 6218
Given Kudos: 136
Re: Each • in the mileage table above represents
[#permalink]
27 Aug 2020, 10:26
27 Aug 2020, 10:26
1
Carcass wrote:
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
APPROACH #1:
Each entry in the mileage table denotes a distinct pair of cities.
We can determine the total number of distinct pairs of cities by using combinations.
When there are 5 cities, the total number of distinct pairs of cities = 5C2 = 10
Noticed that in the given table there are 10 entries. Perfect!
Likewise, if we have a mileage table consisting of 30 cities, the total number of distinct pairs of cities = 30C2 [to learn how to mentally calculate combinations like 30C2, watch the video below]
= (30)(29)/(2)(1)
= 435
Answer: B
APPROACH #2:
Notice that, when there are 5 cities in the mileage table, the number of entries = 1 + 2 + 3 + 4
Likewise, if we have a mileage table consisting of 30 cities, the number of entries = 1 + 2 + 3 + . . . . + 28 + 29
One way to calculate this is to apply the following formula:
The sum of the integers from 1 to n inclusive = (n)(n+1)/2
So, 1+2+...........+28+29 = (29)(29+1)/2
= (29)(30)/2
= (29)(15)
= 435
Answer: B
RELATED VIDEO
