It is currently 23 Sep 2017, 18:37

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

# NEW SET of good PS(3)

Author Message
TAGS:

### Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 41698

Kudos [?]: 124664 [0], given: 12079

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

06 Jul 2012, 02:21
shreya717 wrote:
Shouldn't the answer to Question 2 be B?

Answers are given in the following post: new-set-of-good-ps-85440.html#p642321 OA for this question is A, not B.

The function f is defined for all positive integers n by the following rule. f(n) is the number of positive integers each of which is less than n and has no positive factor in common with n other than 1. If p is a prime number then f(p)=
A. p-1
B. p-2
C. (p+1)/2
D. (p-1)/2
E. 2

If not the wording the question wouldn't be as tough as it is now. The GMAT often hides some simple concept in complicated way of delivering it.

This question for instance basically asks: how many positive integers are less than given prime number p which have no common factor with p except 1.

Well as p is a prime, all positive numbers less than p have no common factors with p (except common factor 1). So there would be p-1 such numbers (as we are looking number of integers less than p).

For example: if p=7 how many numbers are less than 7 having no common factors with 7: 1, 2, 3, 4, 5, 6 --> 7-1=6.

Hope it's clear.
_________________

Kudos [?]: 124664 [0], given: 12079

Intern
Joined: 20 Jun 2011
Posts: 46

Kudos [?]: 116 [0], given: 1

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

16 Oct 2012, 07:07
Bunuel wrote:
5. Mrs. Smith has been given film vouchers. Each voucher allows the holder to see a film without charge. She decides to distribute them among her four nephews so that each nephew gets at least two vouchers. How many vouchers has Mrs. Smith been given if there are 120 ways that she could distribute the vouchers?
(A) 13
(B) 14
(C) 15
(D) 16
(E) more than 16

Clearly there are more than 8 vouchers as each of four can get at least 2. So, basically 120 ways vouchers can the distributed are the ways to distribute $$x-8$$ vouchers, so that each can get from zero to $$x-8$$ as at "least 2", or 2*4=8, we already booked. Let $$x-8$$ be $$k$$.

In how many ways we can distribute $$k$$ identical things among 4 persons? Well there is a formula for this but it's better to understand the concept.

Let $$k=5$$. And imagine we want to distribute 5 vouchers among 4 persons and each can get from zero to 5, (no restrictions).

Consider:

$$ttttt|||$$
We have 5 tickets (t) and 3 separators between them, to indicate who will get the tickets:

$$ttttt|||$$
Means that first nephew will get all the tickets,

$$|t|ttt|t$$
Means that first got 0, second 1, third 3, and fourth 1

And so on.

How many permutations (arrangements) of these symbols are possible? Total of 8 symbols (5+3=8), out of which 5 $$t$$'s and 3 $$|$$'s are identical, so $$\frac{8!}{5!3!}=56$$. Basically it's the number of ways we can pick 3 separators out of 5+3=8: $$8C3$$.

So, # of ways to distribute 5 tickets among 4 people is $$(5+4-1)C(4-1)=8C3$$.

For $$k$$ it will be the same: # of ways to distribute $$k$$ tickets among 4 persons (so that each can get from zero to $$k$$) would be $$(K+4-1)C(4-1)=(k+3)C3=\frac{(k+3)!}{k!3!}=120$$.

$$(k+1)(k+2)(k+3)=3!*120=720$$. --> $$k=7$$. Plus the 8 tickets we booked earlier: $$x=k+8=7+8=15$$.

P.S. Direct formula:

The total number of ways of dividing n identical items among r persons, each one of whom, can receive 0,1,2 or more items is $$n+r-1C_{r-1}$$.

The total number of ways of dividing n identical items among r persons, each one of whom receives at least one item is $$n-1C_{r-1}$$.

Hope it helps.

I tried to backsolve, but even after I saw the formula I failed miserably.

Is it possible to be solving this through backsolving, or would that be too cumbersome? If it is possible, how would you then proceed?

Thanks!

Kudos [?]: 116 [0], given: 1

Manager
Joined: 20 Feb 2013
Posts: 141

Kudos [?]: 36 [0], given: 24

GMAT 3: 720 Q48 V42
Re: NEW SET of good PS(3) [#permalink]

### Show Tags

18 Mar 2013, 14:15
Hi, still not clear why answer to the 2nd ques should be P-1 and not P-2. Shouldn't both P and 1 be deducted from the set?

Kudos [?]: 36 [0], given: 24

Math Expert
Joined: 02 Sep 2009
Posts: 41698

Kudos [?]: 124664 [0], given: 12079

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

18 Mar 2013, 14:24
annutalreja wrote:
Hi, still not clear why answer to the 2nd ques should be P-1 and not P-2. Shouldn't both P and 1 be deducted from the set?

p yes, but not 1.

Consider this, say p=7 how many numbers are less than 7 having no common factors with 7 other than 1: 1, 2, 3, 4, 5, 6 --> 7-1=6. (7 and 1 do not share any common factor other than 1.)

Completes solution is here: new-set-of-good-ps-85440-60.html#p1102100

Hope it helps.
_________________

Kudos [?]: 124664 [0], given: 12079

Manager
Joined: 07 Feb 2011
Posts: 106

Kudos [?]: 63 [0], given: 45

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

26 Mar 2013, 11:38
Bunuel are these all official? The first problem uses the word different which I think is, different from, the word 'unique'. Subtle difference I never noticed but huge implications
_________________

Kudos [?]: 63 [0], given: 45

Current Student
Joined: 06 Jan 2013
Posts: 29

Kudos [?]: 15 [0], given: 70

Schools: CBS '18 (M)
GMAT 1: 700 Q43 V42
GMAT 2: 730 Q47 V42
Re: NEW SET of good PS(3) [#permalink]

### Show Tags

06 Apr 2013, 10:04
Augustus wrote:
yangsta8 wrote:
Bunuel wrote:
1. ABCDE is a regular pentagon with F at its center. How many different triangles can be formed by joining 3 of the points A,B,C,D,E and F?
(A) 10
(B) 15
(C) 20
(D) 25
(E) 30

6 points in total to make triangles. I think a combination of any 3 will make a unique triangle so:
6C3 = 20

Will anyone please explain what the C means in the notation?

That's a notation for Combinations. You have six points to choose from and you're choosing three so (6!)/(3!*3!).

Kudos [?]: 15 [0], given: 70

Intern
Joined: 25 May 2013
Posts: 28

Kudos [?]: 35 [0], given: 16

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

04 Jul 2013, 08:40
Bunuel wrote:
5. Mrs. Smith has been given film vouchers. Each voucher allows the holder to see a film without charge. She decides to distribute them among her four nephews so that each nephew gets at least two vouchers. How many vouchers has Mrs. Smith been given if there are 120 ways that she could distribute the vouchers?
(A) 13
(B) 14
(C) 15
(D) 16
(E) more than 16

Clearly there are more than 8 vouchers as each of four can get at least 2. So, basically 120 ways vouchers can the distributed are the ways to distribute $$x-8$$ vouchers, so that each can get from zero to $$x-8$$ as at "least 2", or 2*4=8, we already booked. Let $$x-8$$ be $$k$$.

In how many ways we can distribute $$k$$ identical things among 4 persons? Well there is a formula for this but it's better to understand the concept.

Let $$k=5$$. And imagine we want to distribute 5 vouchers among 4 persons and each can get from zero to 5, (no restrictions).

Consider:

$$ttttt|||$$
We have 5 tickets (t) and 3 separators between them, to indicate who will get the tickets:

$$ttttt|||$$
Means that first nephew will get all the tickets,

$$|t|ttt|t$$
Means that first got 0, second 1, third 3, and fourth 1

And so on.

How many permutations (arrangements) of these symbols are possible? Total of 8 symbols (5+3=8), out of which 5 $$t$$'s and 3 $$|$$'s are identical, so $$\frac{8!}{5!3!}=56$$. Basically it's the number of ways we can pick 3 separators out of 5+3=8: $$8C3$$.

So, # of ways to distribute 5 tickets among 4 people is $$(5+4-1)C(4-1)=8C3$$.

For $$k$$ it will be the same: # of ways to distribute $$k$$ tickets among 4 persons (so that each can get from zero to $$k$$) would be $$(K+4-1)C(4-1)=(k+3)C3=\frac{(k+3)!}{k!3!}=120$$.

$$(k+1)(k+2)(k+3)=3!*120=720$$. --> $$k=7$$. Plus the 8 tickets we booked earlier: $$x=k+8=7+8=15$$.

P.S. Direct formula:

The total number of ways of dividing n identical items among r persons, each one of whom, can receive 0,1,2 or more items is $$n+r-1C_{r-1}$$.

The total number of ways of dividing n identical items among r persons, each one of whom receives at least one item is $$n-1C_{r-1}$$.

Hope it helps.

Can you explain this more?

Kudos [?]: 35 [0], given: 16

Math Expert
Joined: 02 Sep 2009
Posts: 41698

Kudos [?]: 124664 [0], given: 12079

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

04 Jul 2013, 08:48
akijuneja wrote:
Bunuel wrote:
5. Mrs. Smith has been given film vouchers. Each voucher allows the holder to see a film without charge. She decides to distribute them among her four nephews so that each nephew gets at least two vouchers. How many vouchers has Mrs. Smith been given if there are 120 ways that she could distribute the vouchers?
(A) 13
(B) 14
(C) 15
(D) 16
(E) more than 16

Clearly there are more than 8 vouchers as each of four can get at least 2. So, basically 120 ways vouchers can the distributed are the ways to distribute $$x-8$$ vouchers, so that each can get from zero to $$x-8$$ as at "least 2", or 2*4=8, we already booked. Let $$x-8$$ be $$k$$.

In how many ways we can distribute $$k$$ identical things among 4 persons? Well there is a formula for this but it's better to understand the concept.

Let $$k=5$$. And imagine we want to distribute 5 vouchers among 4 persons and each can get from zero to 5, (no restrictions).

Consider:

$$ttttt|||$$
We have 5 tickets (t) and 3 separators between them, to indicate who will get the tickets:

$$ttttt|||$$
Means that first nephew will get all the tickets,

$$|t|ttt|t$$
Means that first got 0, second 1, third 3, and fourth 1

And so on.

How many permutations (arrangements) of these symbols are possible? Total of 8 symbols (5+3=8), out of which 5 $$t$$'s and 3 $$|$$'s are identical, so $$\frac{8!}{5!3!}=56$$. Basically it's the number of ways we can pick 3 separators out of 5+3=8: $$8C3$$.

So, # of ways to distribute 5 tickets among 4 people is $$(5+4-1)C(4-1)=8C3$$.

For $$k$$ it will be the same: # of ways to distribute $$k$$ tickets among 4 persons (so that each can get from zero to $$k$$) would be $$(K+4-1)C(4-1)=(k+3)C3=\frac{(k+3)!}{k!3!}=120$$.

$$(k+1)(k+2)(k+3)=3!*120=720$$. --> $$k=7$$. Plus the 8 tickets we booked earlier: $$x=k+8=7+8=15$$.

P.S. Direct formula:

The total number of ways of dividing n identical items among r persons, each one of whom, can receive 0,1,2 or more items is $$n+r-1C_{r-1}$$.

The total number of ways of dividing n identical items among r persons, each one of whom receives at least one item is $$n-1C_{r-1}$$.

Hope it helps.

Can you explain this more?

Check here: mrs-smith-has-been-given-film-vouchers-each-voucher-allows-98225.html

Similar questions:
larry-michael-and-doug-have-five-donuts-to-share-if-any-108739.html
how-many-positive-integers-less-than-10-000-are-there-in-85291.html
how-many-positive-integers-less-than-10-000-are-there-in-whi-91261.html

Hope it helps.
_________________

Kudos [?]: 124664 [0], given: 12079

Manager
Joined: 07 May 2013
Posts: 108

Kudos [?]: 29 [0], given: 1

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

22 Nov 2013, 22:00
Buneul, please explain the solution for problem no.9. Thanks in advance .

Kudos [?]: 29 [0], given: 1

Math Expert
Joined: 02 Sep 2009
Posts: 41698

Kudos [?]: 124664 [0], given: 12079

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

23 Nov 2013, 06:10
Buneul, please explain the solution for problem no.9. Thanks in advance .

_________________

Kudos [?]: 124664 [0], given: 12079

Manager
Joined: 14 Nov 2011
Posts: 145

Kudos [?]: 20 [1], given: 103

Location: United States
Concentration: General Management, Entrepreneurship
GPA: 3.61
WE: Consulting (Manufacturing)
Re: NEW SET of good PS(3) [#permalink]

### Show Tags

30 Nov 2013, 23:17
1
KUDOS
VeritasPrepKarishma wrote:
yogesh1984 wrote:

Bunuel,

1- Collinear point issue will arise in case of overlapping values of x, y ? (as in here we have all the overlapping range for x & y). Also since range here is small for both x, y (ie.=3) we can manually calculate the collinear points but in case of large range how do we go about it ? should it be = # overlapping points on X + # overlapping points on Y + # diagonal points (which will essentially be min(# overlapping points on X , Y) -1 )-- Not so sure on this though ...

2- I see a similar Question in OG12 PS Q.229- The method explained here in the above example does not seems to fit too well there. basically in the question we have -4 <= X <=5, 6<= Y <=16. Can you please throw some light in the context of OG question....

TIA ~ Yogesh

ps-right-triangle-pqr-71597.html?hilit=how%20many%20triangles#p830694
It discusses what to do in case of a larger range.

Hi Karishma,

To find out the possible number of right triangles I tried as below:
No. of rectangles *4 (for each orientation)

For example: How many triangles with positive area can be drawn on the coordinate plane such that the vertices have integer coordinates (x,y) satisfying 2 ≤ x ≤ 4 and 5 ≤ y ≤ 7?

No. of rectangles = 9 (this by actual counting of rectangles)
No. of right triangles = 4*9 = 36, Is this correct?

Secondly, I tried to calculate no. of rectangles via combinations but i count understand why no. of rectangles would be 3c2*3c2?

To me it should be = 3c2*(3-1)=6, but this is not correct.

Kudos [?]: 20 [1], given: 103

Manager
Joined: 14 Nov 2011
Posts: 145

Kudos [?]: 20 [0], given: 103

Location: United States
Concentration: General Management, Entrepreneurship
GPA: 3.61
WE: Consulting (Manufacturing)
Re: NEW SET of good PS(3) [#permalink]

### Show Tags

01 Dec 2013, 01:28
yossarian84 wrote:
Bunuel wrote:
5. Mrs. Smith has been given film vouchers. Each voucher allows the holder to see a film without charge. She decides to distribute them among her four nephews so that each nephew gets at least two vouchers. How many vouchers has Mrs. Smith been given if there are 120 ways that she could distribute the vouchers?
(A) 13
(B) 14
(C) 15
(D) 16
(E) more than 16

Clearly there are more than 8 vouchers as each of four can get at least 2. So, basically 120 ways vouchers can the distributed are the ways to distribute $$x-8$$ vouchers, so that each can get from zero to $$x-8$$ as at "least 2", or 2*4=8, we already booked. Let $$x-8$$ be $$k$$.

In how many ways we can distribute $$k$$ identical things among 4 persons? Well there is a formula for this but it's better to understand the concept.

Let $$k=5$$. And imagine we want to distribute 5 vouchers among 4 persons and each can get from zero to 5, (no restrictions).

Consider:

$$ttttt|||$$
We have 5 tickets (t) and 3 separators between them, to indicate who will get the tickets:

$$ttttt|||$$
Means that first nephew will get all the tickets,

$$|t|ttt|t$$
Means that first got 0, second 1, third 3, and fourth 1

And so on.

How many permutations (arrangements) of these symbols are possible? Total of 8 symbols (5+3=8), out of which 5 $$t$$'s and 3 $$|$$'s are identical, so $$\frac{8!}{5!3!}=56$$. Basically it's the number of ways we can pick 3 separators out of 5+3=8: $$8C3$$.

So, # of ways to distribute 5 tickets among 4 people is $$(5+4-1)C(4-1)=8C3$$.

For $$k$$ it will be the same: # of ways to distribute $$k$$ tickets among 4 persons (so that each can get from zero to $$k$$) would be $$(K+4-1)C(4-1)=(k+3)C3=\frac{(k+3)!}{k!3!}=120$$.

$$(k+1)(k+2)(k+3)=3!*120=720$$. --> $$k=7$$. Plus the 8 tickets we booked earlier: $$x=k+8=7+8=15$$.

P.S. Direct formula:

The total number of ways of dividing n identical items among r persons, each one of whom, can receive 0,1,2 or more items is $$n+r-1C_{r-1}$$.

The total number of ways of dividing n identical items among r persons, each one of whom receives at least one item is $$n-1C_{r-1}$$.

Hope it helps.

Awesome...hats off...this is totally new to me...widens my realm..and strengthens my reasoning...thanks a lot

Karishma/Bunnel,

There one more formula to distribute n things in m, such that each m can receive 0 to n items = m^n.
Thing to be distributed goes in the power.

Can we do 4^(n-8)=120??

Kudos [?]: 20 [0], given: 103

Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 7615

Kudos [?]: 16944 [0], given: 230

Location: Pune, India
Re: NEW SET of good PS(3) [#permalink]

### Show Tags

01 Dec 2013, 21:35
cumulonimbus wrote:
VeritasPrepKarishma wrote:
yogesh1984 wrote:

Bunuel,

1- Collinear point issue will arise in case of overlapping values of x, y ? (as in here we have all the overlapping range for x & y). Also since range here is small for both x, y (ie.=3) we can manually calculate the collinear points but in case of large range how do we go about it ? should it be = # overlapping points on X + # overlapping points on Y + # diagonal points (which will essentially be min(# overlapping points on X , Y) -1 )-- Not so sure on this though ...

2- I see a similar Question in OG12 PS Q.229- The method explained here in the above example does not seems to fit too well there. basically in the question we have -4 <= X <=5, 6<= Y <=16. Can you please throw some light in the context of OG question....

TIA ~ Yogesh

ps-right-triangle-pqr-71597.html?hilit=how%20many%20triangles#p830694
It discusses what to do in case of a larger range.

Hi Karishma,

To find out the possible number of right triangles I tried as below:
No. of rectangles *4 (for each orientation)

For example: How many triangles with positive area can be drawn on the coordinate plane such that the vertices have integer coordinates (x,y) satisfying 2 ≤ x ≤ 4 and 5 ≤ y ≤ 7?

No. of rectangles = 9 (this by actual counting of rectangles)
No. of right triangles = 4*9 = 36, Is this correct?

Secondly, I tried to calculate no. of rectangles via combinations but i count understand why no. of rectangles would be 3c2*3c2?

To me it should be = 3c2*(3-1)=6, but this is not correct.

The method is correct for this question. Number of right triangles will be 36.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199 Veritas Prep Reviews Kudos [?]: 16944 [0], given: 230 Veritas Prep GMAT Instructor Joined: 16 Oct 2010 Posts: 7615 Kudos [?]: 16944 [1], given: 230 Location: Pune, India Re: NEW SET of good PS(3) [#permalink] ### Show Tags 01 Dec 2013, 21:45 1 This post received KUDOS Expert's post cumulonimbus wrote: VeritasPrepKarishma wrote: yogesh1984 wrote: Bunuel, 1- Collinear point issue will arise in case of overlapping values of x, y ? (as in here we have all the overlapping range for x & y). Also since range here is small for both x, y (ie.=3) we can manually calculate the collinear points but in case of large range how do we go about it ? should it be = # overlapping points on X + # overlapping points on Y + # diagonal points (which will essentially be min(# overlapping points on X , Y) -1 )-- Not so sure on this though ... 2- I see a similar Question in OG12 PS Q.229- The method explained here in the above example does not seems to fit too well there. basically in the question we have -4 <= X <=5, 6<= Y <=16. Can you please throw some light in the context of OG question.... TIA ~ Yogesh Check out this thread: ps-right-triangle-pqr-71597.html?hilit=how%20many%20triangles#p830694 It discusses what to do in case of a larger range. Secondly, I tried to calculate no. of rectangles via combinations but i count understand why no. of rectangles would be 3c2*3c2? To me it should be = 3c2*(3-1)=6, but this is not correct. Make the coordinate axis, mark the coordinates and make all vertical and horizontal lines, To make a rectangle, you need 2 horizontal and 2 vertical lines. You have 3 vertical lines and 3 horizontal lines. You select 2 of each in 3C2 * 3C2 ways. Similarly, say 2 <= x <= 5 and 5<= y <= 7. Calculate manually to get 18 rectangles. Use 4C2*3C2 to get 18 rectangles too. _________________ Karishma Veritas Prep | GMAT Instructor My Blog Get started with Veritas Prep GMAT On Demand for$199

Veritas Prep Reviews

Kudos [?]: 16944 [1], given: 230

Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 7615

Kudos [?]: 16944 [0], given: 230

Location: Pune, India
Re: NEW SET of good PS(3) [#permalink]

### Show Tags

01 Dec 2013, 21:50
cumulonimbus wrote:
Karishma/Bunnel,

There one more formula to distribute n things in m, such that each m can receive 0 to n items = m^n.
Thing to be distributed goes in the power.

Can we do 4^(n-8)=120??

Things need to be distinct in that case. This is a case of identical things.
Check these posts for a discussion on these differences:
http://www.veritasprep.com/blog/2011/12 ... 93-part-1/
http://www.veritasprep.com/blog/2011/12 ... s-part-ii/
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199 Veritas Prep Reviews Kudos [?]: 16944 [0], given: 230 Manager Joined: 14 Nov 2011 Posts: 145 Kudos [?]: 20 [0], given: 103 Location: United States Concentration: General Management, Entrepreneurship GPA: 3.61 WE: Consulting (Manufacturing) Re: NEW SET of good PS(3) [#permalink] ### Show Tags 05 Dec 2013, 21:11 The method is correct for this question. Number of right triangles will be 36. Hi Karishma, Do you mean I cannot use the above method for all questions for getting the number of right triangles? Kudos [?]: 20 [0], given: 103 Veritas Prep GMAT Instructor Joined: 16 Oct 2010 Posts: 7615 Kudos [?]: 16944 [0], given: 230 Location: Pune, India Re: NEW SET of good PS(3) [#permalink] ### Show Tags 05 Dec 2013, 21:33 cumulonimbus wrote: The method is correct for this question. Number of right triangles will be 36. Hi Karishma, Do you mean I cannot use the above method for all questions for getting the number of right triangles? Whenever an innovative method is used, we need to understand its assumptions. Here we are looking for right triangles with all integer coordinates lying within a certain range. If one of these conditions is not met, the method will change. Of course there is nothing special about these particular values: 2 ≤ x ≤ 4 and 5 ≤ y ≤ 7 and as discussed above, the method will work for any other such set of values e.g. 2 <= x <= 5 and 5<= y <= 7 or -1 <= x <= 7 and 2<= y <= 7 etc. There is nothing wrong with this approach - in fact it's great. You can certainly solve a similar question using this approach. But it is important for you to understand the generic method too (for more generic questions, say all triangles, not just right triangles or some other variation) so that you can twist it according to the question at hand, if required. _________________ Karishma Veritas Prep | GMAT Instructor My Blog Get started with Veritas Prep GMAT On Demand for$199

Veritas Prep Reviews

Kudos [?]: 16944 [0], given: 230

Intern
Joined: 30 Jul 2013
Posts: 42

Kudos [?]: 15 [0], given: 27

Concentration: Technology, General Management
GMAT Date: 07-03-2015
GPA: 3.8
WE: Information Technology (Computer Software)
Re: NEW SET of good PS(3) [#permalink]

### Show Tags

11 Apr 2014, 03:27
'C' is the combination. It is the selection of the items where the order does not matter. Please refer to Combinatorics.
_________________

On the Kudos Spree.

If you like my post/comment please appreciate with kudos

Kudos [?]: 15 [0], given: 27

Manager
Joined: 04 Jan 2014
Posts: 122

Kudos [?]: 14 [0], given: 24

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

18 Apr 2014, 07:57
I still don't get question 8 and 10?

Kudos [?]: 14 [0], given: 24

Math Expert
Joined: 02 Sep 2009
Posts: 41698

Kudos [?]: 124664 [0], given: 12079

Re: NEW SET of good PS(3) [#permalink]

### Show Tags

18 Apr 2014, 10:15
pretzel wrote:
I still don't get question 8 and 10?

Solution for them is here: new-set-of-good-ps-85440-20.html#p668824

Hope it helps.
_________________

Kudos [?]: 124664 [0], given: 12079

Re: NEW SET of good PS(3)   [#permalink] 18 Apr 2014, 10:15

Go to page   Previous    1   2   3   4   5    Next  [ 93 posts ]

Display posts from previous: Sort by