It is currently 23 Jun 2017, 21:20

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# Each • in the mileage table above represents an entry indica

Author Message
TAGS:

### Hide Tags

Manager
Joined: 27 Apr 2010
Posts: 119
Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

02 Jun 2010, 10:32
3
KUDOS
43
This post was
BOOKMARKED
00:00

Difficulty:

45% (medium)

Question Stats:

68% (02:28) correct 32% (01:48) wrong based on 1454 sessions

### HideShow timer Statistics

Attachment:

Table.png [ 23.23 KiB | Viewed 24125 times ]
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
[Reveal] Spoiler: OA

Last edited by Bunuel on 12 Dec 2012, 10:09, edited 3 times in total.
Renamed the topic and edited the question.
VP
Joined: 05 Mar 2008
Posts: 1469
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

02 Jun 2010, 11:42
15
KUDOS
11
This post was
BOOKMARKED
snkrhed wrote:
So there's a chart that looks a lot like this:

-E D C B A
A * * * *
B * * *
C * *
D *
E

Each * in the mileage table above represents an entry indicating the distance 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

City B, the second city has 1 point
City C the third city has 2 points
City D, the fourth city has 3 points

What's the pattern?

Number of cities minus 1 so the 30th city is going to have 29 points

Then it becomes a matter of adding the consecutive integers from 1 to 29
The sum is the average * number of terms
average = 15
number of terms = 29
29*15 = 435
Math Expert
Joined: 02 Sep 2009
Posts: 39622
Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

02 Jun 2010, 11:54
12
KUDOS
Expert's post
15
This post was
BOOKMARKED
snkrhed wrote:
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 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$$

_________________
Manager
Status: Waiting to hear from University of Texas at Austin
Joined: 24 May 2010
Posts: 76
Location: Changchun, China
Schools: University of Texas at Austin, Michigan State
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

30 Jun 2010, 02:16
10
KUDOS
1
This post was
BOOKMARKED
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?
Manager
Joined: 24 Dec 2009
Posts: 219
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

30 Jun 2010, 07:45
1
KUDOS
1
This post was
BOOKMARKED
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
Intern
Joined: 03 Jan 2013
Posts: 4
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

03 Jan 2013, 12:54
Bunuel wrote:
snkrhed wrote:
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$$

Hello, Bunuel
Which formula did you use here ?

Thanks,
Manager
Joined: 18 Oct 2011
Posts: 90
Location: United States
Concentration: Entrepreneurship, Marketing
GMAT Date: 01-30-2013
GPA: 3.3
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

03 Jan 2013, 13:37
Combinations formula.

Current Student
Joined: 18 May 2013
Posts: 41
Concentration: Real Estate, Finance
GPA: 3.73
WE: Analyst (Real Estate)
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

10 Nov 2013, 23:42
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.
Manager
Joined: 04 Oct 2013
Posts: 177
GMAT 1: 590 Q40 V30
GMAT 2: 730 Q49 V40
WE: Project Management (Entertainment and Sports)
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

16 Feb 2014, 02:47
1
KUDOS
stevennu wrote:
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.
_________________

learn the rules of the game, then play better than anyone else.

Senior Manager
Joined: 15 Aug 2013
Posts: 311
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

13 Apr 2014, 12:30
Bunuel wrote:
snkrhed wrote:
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$$

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)!}$$"
Math Expert
Joined: 02 Sep 2009
Posts: 39622
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

14 Apr 2014, 01:04
1
KUDOS
Expert's post
1
This post was
BOOKMARKED
russ9 wrote:
Bunuel wrote:
snkrhed wrote:
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$$

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.
_________________
Senior Manager
Joined: 15 Aug 2013
Posts: 311
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

09 May 2014, 15:22
Bunuel wrote:

$$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?
Math Expert
Joined: 02 Sep 2009
Posts: 39622
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

10 May 2014, 05:06
Expert's post
1
This post was
BOOKMARKED
russ9 wrote:
Bunuel wrote:

$$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?
_________________
Senior Manager
Joined: 15 Aug 2013
Posts: 311
Re: PS Q: OG-12 #116 [#permalink]

### Show Tags

15 May 2014, 16:02
Bunuel wrote:
russ9 wrote:
Bunuel wrote:

$$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?

Yes, now it does. Thanks!
Intern
Joined: 08 Jan 2013
Posts: 1
Schools: AGSM '16 (I)
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

13 Oct 2014, 03:08
2
KUDOS
1
This post was
BOOKMARKED
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.

VP
Joined: 26 Mar 2013
Posts: 1010
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

08 Nov 2014, 11:10
zubinator wrote:
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.

Hi Bunuel,
I solved this problem as permutation 5P2= 870 then By symmetry we need only half of the table so total # of dots=870/2 = 435.........Answer B.

So is there any problem to solve it like using permutation?
Director
Status: No dream is too large, no dreamer is too small
Joined: 14 Jul 2010
Posts: 633
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

14 Apr 2015, 08:26
How if as:
the pattern is 5*5= 25-5=20/2=10
Thus, 30*30= 900-30= 870/2 = 435
_________________

Collections:-
PSof OG solved by GC members: http://gmatclub.com/forum/collection-ps-with-solution-from-gmatclub-110005.html
DS of OG solved by GC members: http://gmatclub.com/forum/collection-ds-with-solution-from-gmatclub-110004.html
100 GMAT PREP Quantitative collection http://gmatclub.com/forum/gmat-prep-problem-collections-114358.html
Collections of work/rate problems with solutions http://gmatclub.com/forum/collections-of-work-rate-problem-with-solutions-118919.html
Mixture problems in a file with best solutions: http://gmatclub.com/forum/mixture-problems-with-best-and-easy-solutions-all-together-124644.html

Director
Status: No dream is too large, no dreamer is too small
Joined: 14 Jul 2010
Posts: 633
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

14 Apr 2015, 08:28
Mo2men wrote:
zubinator wrote:
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.

Hi Bunuel,
I solved this problem as permutation 5P2= 870 then By symmetry we need only half of the table so total # of dots=870/2 = 435.........Answer B.

So is there any problem to solve it like using permutation?

Why shall I go for 5 rather 30?
_________________

Collections:-
PSof OG solved by GC members: http://gmatclub.com/forum/collection-ps-with-solution-from-gmatclub-110005.html
DS of OG solved by GC members: http://gmatclub.com/forum/collection-ds-with-solution-from-gmatclub-110004.html
100 GMAT PREP Quantitative collection http://gmatclub.com/forum/gmat-prep-problem-collections-114358.html
Collections of work/rate problems with solutions http://gmatclub.com/forum/collections-of-work-rate-problem-with-solutions-118919.html
Mixture problems in a file with best solutions: http://gmatclub.com/forum/mixture-problems-with-best-and-easy-solutions-all-together-124644.html

Intern
Joined: 09 Dec 2014
Posts: 6
Location: United States
Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

15 Apr 2015, 10:32
The distance from each city to its own is not represented in the table.
So in the case of 5 cities, each city can have a distance w.r.t another 4 cities. ( A-B,A-C,A-D,A-E; BUT NOT A-A)
Hence these 5 cities can have 5*4 = 20 distances.
However we are representing each distance (to and fro) only once instead of twice. e.g A-B is same as B-A. Hence divide 20/2 = 10 dots

Similarly, in case of 30 cities, total distances will be 30*29 = 870
But we want to represent each distance only once instead of twice, so 870/2= 435 dots

Hope its clear!
Intern
Joined: 18 Apr 2015
Posts: 30
Re: Each • in the mileage table above represents an entry indica [#permalink]

### Show Tags

18 Apr 2015, 09:14
Hi Mates,

How are we getting this 29 for 30 cities?
Re: Each • in the mileage table above represents an entry indica   [#permalink] 18 Apr 2015, 09:14

Go to page    1   2    Next  [ 34 posts ]

Similar topics Replies Last post
Similar
Topics:
The table shown above represents the relationship of the working hours 3 03 May 2017, 02:26
27 The table above shows the number of packages shipped daily by each of 3 05 Dec 2016, 18:20
24 In the table above, what is the least number of table entrie 15 04 Apr 2017, 16:20
13 In the table above what is the least number of table entries 7 10 Jun 2017, 06:47
3 In the table above, what is the least number of table entries that are 6 13 Jun 2017, 09:46
Display posts from previous: Sort by