Last visit was: 15 Jul 2025, 05:48 It is currently 15 Jul 2025, 05:48
Close
GMAT 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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
555-605 Level|   Combinations|                     
User avatar
snkrhed
Joined: 27 Apr 2010
Last visit: 21 May 2017
Posts: 75
Own Kudos:
800
 [407]
Given Kudos: 61
Products:
23
Kudos
Add Kudos
383
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
lagomez
Joined: 05 Mar 2008
Last visit: 18 Sep 2011
Posts: 1,225
Own Kudos:
543
 [74]
Given Kudos: 31
Posts: 1,225
Kudos: 543
 [74]
48
Kudos
Add Kudos
25
Bookmarks
Bookmark this Post
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 14 Jul 2025
Posts: 102,576
Own Kudos:
Given Kudos: 98,190
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,576
Kudos: 741,542
 [59]
26
Kudos
Add Kudos
33
Bookmarks
Bookmark this Post
User avatar
TallJTinChina
Joined: 24 May 2010
Last visit: 28 Jun 2011
Posts: 38
Own Kudos:
144
 [28]
Given Kudos: 4
Status:Waiting to hear from University of Texas at Austin
Location: Changchun, China
Concentration: MSA - Generalist
Schools:University of Texas at Austin, Michigan State
 Q46  V44
GPA: 3.9
Posts: 38
Kudos: 144
 [28]
26
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Because the GMAT is multiple choice.

I first found the pattern mentioned each additional city adds (total cities - 1) to the table.

So I figure with 30 cities the last 3 cities added 29+28+27 to our total number of entries so (A) is ridiculous

And I knew the whole table would be 30x30 with 900 entries. Since I know I will not have entries for each box I ruled out (E) 900

Looking at the remaining choices I thought

(B) 435 = less than half the table is filled
(C) 450 = exactly half the table is filled
(D) 465 = more than half the table is filled

The table given shows a 5x5 table with only 10 entries. 10< .5(25)

So I chose (B).

This method works for these answer choices, but if the choices were 430, 435, 440 I would be screwed right?
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 13 May 2024
Posts: 6,755
Own Kudos:
34,086
 [27]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,755
Kudos: 34,086
 [27]
15
Kudos
Add Kudos
12
Bookmarks
Bookmark this Post
snkrhed

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


Attachment:
Table.png

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

Cheers,
Brent

RELATED VIDEO
General Discussion
User avatar
amp0201
Joined: 24 Dec 2009
Last visit: 14 Aug 2013
Posts: 115
Own Kudos:
130
 [10]
Given Kudos: 3
Posts: 115
Kudos: 130
 [10]
5
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
This can be done in n * (n - 1) / 2 ways.

Hence -> 30 * 29 / 2 = 435 ways.

Correct answer choice is B. Thank You.

Thanks,
Akhil M.Parekh
avatar
stevennu
Joined: 18 May 2013
Last visit: 26 Jan 2016
Posts: 32
Own Kudos:
Given Kudos: 2
Concentration: Real Estate, Finance
GPA: 3.73
WE:Analyst (Real Estate)
Posts: 32
Kudos: 16
Kudos
Add Kudos
Bookmarks
Bookmark this Post
How would this question be solved using a consecutive integer format? Can you find the average on the consecutive integers and then multiply by the number of terms? I ask because this question is listed as a consecutive integer question in the MGAMT quant guide.
User avatar
gmat6nplus1
Joined: 04 Oct 2013
Last visit: 09 Jan 2019
Posts: 141
Own Kudos:
665
 [2]
Given Kudos: 29
Concentration: Finance, Leadership
GMAT 1: 590 Q40 V30
GMAT 2: 730 Q49 V40
WE:Project Management (Media/Entertainment)
GMAT 2: 730 Q49 V40
Posts: 141
Kudos: 665
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
stevennu
How would this question be solved using a consecutive integer format? Can you find the average on the consecutive integers and then multiply by the number of terms? I ask because this question is listed as a consecutive integer question in the MGAMT quant guide.


If second entry =1
third entry = 2
30th entry = 29 etc

Thus S(n)=n/2(2a+(n-1)d) where a=1, d=1, n=29
plug in and you get the answer.
User avatar
russ9
Joined: 15 Aug 2013
Last visit: 20 Apr 2015
Posts: 176
Own Kudos:
Given Kudos: 23
Posts: 176
Kudos: 376
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
snkrhed
Attachment:
img.jpg
Each dot 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 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

We are there told that there should be one entry for each pair. How many entries would the table then have? Or how many different pairs can 30 cities give?

\(C^2_{30}=435\)

Answer: B.

Hi Bunuel,

Can you please elaborate on how this formula works?

Thanks!

EDIT: I did it via the table method but i've seen your formula pop up quite often and I'm failing miserably at it. That might explain the horrible score in NP. :)

I understand what formula to use but i'm having a hard time connecting the formula to the problem "\(C^n_k = \frac{n!}{k!(n-k)!}\)"
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 14 Jul 2025
Posts: 102,576
Own Kudos:
741,542
 [4]
Given Kudos: 98,190
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,576
Kudos: 741,542
 [4]
2
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
russ9
Bunuel
snkrhed
Attachment:
img.jpg
Each dot 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 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

We are there told that there should be one entry for each pair. How many entries would the table then have? Or how many different pairs can 30 cities give?

\(C^2_{30}=435\)

Answer: B.

Hi Bunuel,

Can you please elaborate on how this formula works?

Thanks!

EDIT: I did it via the table method but i've seen your formula pop up quite often and I'm failing miserably at it. That might explain the horrible score in NP. :)

I understand what formula to use but i'm having a hard time connecting the formula to the problem "\(C^n_k = \frac{n!}{k!(n-k)!}\)"

\(C^2_{30}\) is choosing 2 out of 30. There are 30 cities and each pair of cities need an entry, hence 30 cites need \(C^2_{30}\) entries.

Hope it's clear.
User avatar
russ9
Joined: 15 Aug 2013
Last visit: 20 Apr 2015
Posts: 176
Own Kudos:
376
 [1]
Given Kudos: 23
Posts: 176
Kudos: 376
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel

\(C^2_30\) is choosing 2 out of 30. There are 30 cities and each pair of cities need an entry, hence 30 cites need \(C^2_30\) entries.

Hope it's clear.

Hi Bunuel,

Unfortunately, still not clear. Why are we choosing 2 out of 30?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 14 Jul 2025
Posts: 102,576
Own Kudos:
741,542
 [3]
Given Kudos: 98,190
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,576
Kudos: 741,542
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
russ9
Bunuel

\(C^2_30\) is choosing 2 out of 30. There are 30 cities and each pair of cities need an entry, hence 30 cites need \(C^2_30\) entries.

Hope it's clear.

Hi Bunuel,

Unfortunately, still not clear. Why are we choosing 2 out of 30?

Consider the table given in the original post:

A and B have 1 entry;
A and C have 1 entry;
A and D have 1 entry;
A and E have 1 entry;
B and C have 1 entry;
B and D have 1 entry;
B and E have 1 entry;
C and D have 1 entry;
C and E have 1 entry;
D and E have 1 entry.

So, each pair of letters from {A, B, C, D, E} has 1 entry, total of 10 entries. How many pairs can we have? \(C^2_5=10\).

Does this make sense?
avatar
zubinator
Joined: 08 Jan 2013
Last visit: 16 Nov 2015
Posts: 1
Own Kudos:
3
 [3]
Given Kudos: 4
Posts: 1
Kudos: 3
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Combination formula is no doubt easiest and fastest. But other method is

Imagine it was an excel spreadsheet. Remove Cells A1, B2, C3, D4 etc, basically a diagonal across. Total will be 30 such cells.
So now we have 900 - 30 = 870.

On both sides of the diagonal distance (between cities) is shown twice.

Therefore divide 870 into half.

Answer 435.
User avatar
MHIKER
Joined: 14 Jul 2010
Last visit: 24 May 2021
Posts: 945
Own Kudos:
5,461
 [2]
Given Kudos: 690
Status:No dream is too large, no dreamer is too small
Concentration: Accounting
Posts: 945
Kudos: 5,461
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
How if as:
the pattern is 5*5= 25-5=20/2=10
Thus, 30*30= 900-30= 870/2 = 435
avatar
kirtivardhan
Joined: 18 Apr 2015
Last visit: 21 May 2018
Posts: 13
Own Kudos:
Given Kudos: 5
Posts: 13
Kudos: 4
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi Mates,

How are we getting this 29 for 30 cities?
User avatar
EMPOWERgmatRichC
User avatar
Major Poster
Joined: 19 Dec 2014
Last visit: 31 Dec 2023
Posts: 21,788
Own Kudos:
12,492
 [1]
Given Kudos: 450
Status:GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Expert
Expert reply
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Posts: 21,788
Kudos: 12,492
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi kirtivardhan,

The prompt gives us a 5x5 table, then tells us that it will be EXTENDED to a 30x30 table. From the table, you can see the 'pattern' involving the dots - as you go 'to the right', each column has one more dot in it than the column before. This means the final column will have 29 dots in it.

There are actually several different ways to answer this question. Noticing that LESS than HALF of the squares have dots in them and using the "spread" of the answer choices can help you to avoid most of the "math" involved in this question.

GMAT assassins aren't born, they're made,
Rich
avatar
stephyw
Joined: 11 Jun 2015
Last visit: 16 Mar 2017
Posts: 7
Own Kudos:
5
 [2]
Given Kudos: 11
Posts: 7
Kudos: 5
 [2]
1
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
I used one of the Kaplan formulas:

Sum of Sequence = Mean of terms * number of terms

Mean of terms (when evenly spaced) = (Largest Number - Smallest Number)/2
Number of terms = (Largest Number - Smallest Number) + 1

Mean = (1 + 29)/2 = 15
Terms = (29-1)+1 = 29

Sum of Sequence = 15*29 = 435

I used 1 and 29, because there are 30 rows, but the first is blank so R1 has 0, R2 has 1, R3 has 2..... R29 has 28, and R30 has 29.

Is this method correct to use?
User avatar
EMPOWERgmatRichC
User avatar
Major Poster
Joined: 19 Dec 2014
Last visit: 31 Dec 2023
Posts: 21,788
Own Kudos:
Given Kudos: 450
Status:GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Expert
Expert reply
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Posts: 21,788
Kudos: 12,492
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi stephyw,

Your approach absolutely works. If you read the other posts in this thread, you'll see that there are several ways to approach this prompt (and most of the questions that you'll see on Test Day will also be approachable in multiple ways). This goes to show that just because you got a question correct doesn't necessarily mean that you can't improve on your process. There might be a faster, more strategic way to approach the prompt; there might be a way that requires less 'work', etc. As you continue to study, you should commit some of your time to improving your overall tactical knowledge - those other methods can help you to increase your scores, improve your pacing and get "unstuck" when dealing with a question in which "your" approach doesn't seem to get you to the solution.

GMAT assassins aren't born, they're made,
Rich
User avatar
JeffTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 04 Mar 2011
Last visit: 05 Jan 2024
Posts: 2,996
Own Kudos:
7,934
 [3]
Given Kudos: 1,646
Status:Head GMAT Instructor
Affiliations: Target Test Prep
Expert
Expert reply
Posts: 2,996
Kudos: 7,934
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
snkrhed


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

Solution:

This problem can best be solved using combinations.

This problem is similar to one in which 30 sports teams are playing in a tournament where every team plays every other team exactly once. No team plays itself, obviously, and the order of each pairing doesn't matter. [For example, if Team A plays Team B, the pairing of (Team A vs. Team B) is identical to (Team B vs. Team A)]. We would calculate 30C2, or the number of combinations of 30 items taken 2 at a time.

We also can solve this problem in the same way:

30C2 = 30! / [2! x (30 – 2)!]

(30 x 29 x 28!) / [2! x 28!]

(30 x 29)/2!

(30 x 29) / 2

15 x 29 = 435

Answer B
User avatar
ScottTargetTestPrep
User avatar
Target Test Prep Representative
Joined: 14 Oct 2015
Last visit: 15 Jul 2025
Posts: 21,110
Own Kudos:
Given Kudos: 296
Status:Founder & CEO
Affiliations: Target Test Prep
Location: United States (CA)
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 21,110
Kudos: 26,166
Kudos
Add Kudos
Bookmarks
Bookmark this Post

snkrhed

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


Attachment:
Table.png

Solution:

This problem can best be solved using combinations.

This problem is similar to one in which 30 sports teams are playing in a tournament in which every team plays every other team exactly once. No team plays itself, obviously, and the order of each pairing doesn't matter. [For example, if Team A plays Team B, the pairing of (Team A vs. Team B) is identical to (Team B vs. Team A)]. We would calculate 30C2, or the number of combinations of 30 items taken 2 at a time.

We can solve this problem in the same way:

30C2 = (30 x 29) / 2! = 15 x 29 = 435

Alternate Solution:

Notice that when there are 5 cities, there are 1 + 2 + 3 + 4 entries.

If there were 6 cities, the last column would have contained 5 entries; therefore there would have been 1 + 2 + 3 + 4 + 5 entries. Notice that the last column always contains one less entry than the number of cities.

Thus, if there were 30 cities, there would have been 1 + 2 + 3 + … + 29 = (29 * 30)/2 = 29 * 15 = 435 entries.

Answer: B
 1   2   
Moderators:
Math Expert
102576 posts
PS Forum Moderator
691 posts