|
Author |
Message |
|
TAGS:
|
|
|
Intern
Joined: 09 Dec 2008
Posts: 29
Location: Vietnam
Schools: Somewhere
Followers: 0
Kudos [?]:
0
[0], given: 2
|
Mrs. Smith has been given film vouchers. Each voucher allows [#permalink]
 29 Jul 2010, 14:24
Question Stats:
41% (04:50) correct
58% (01:04) wrong based on 1 sessions
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
Last edited by Bunuel on 08 Jan 2013, 03:16, edited 1 time in total.
RENAMED THE TOPIC.
|
|
|
|
|
|
|
Intern
Joined: 03 Mar 2010
Posts: 41
Followers: 1
Kudos [?]:
6
[1] , given: 1
|
1
This post received
KUDOS
It took me 10 minutes to solve it  First, it is remarked that all vouchers are equivalent. Let's call nephews A, B, C, D and their number of vouchers (2+a), (2+b), (2+c), and (2+d), respectively, where a, b, c, d non negative integers (since each of them has at least 2 vouchers). If n is the total number of vouchers, then: a+b+c+d=n-8 or a+b+c+d=m with m=n-8 Let X=a+b and Y=c+d so X+Y=m and (m+1) possible couples are (X=0, Y=m), (X=1, Y=m-1), ..., (X=m, Y=0) On the other hand, (a, b) such that a+b=k and a,b>=0, the number of such couples is equal to k+1. Therefore, generic solution is: 1*(m+1)+2*m+3*(m-1)+...+m*2+(m+1)*1 To get 120 different ways, m equals to 7, or n=15, thus C. Sure this is not the easiest way to deal with this problem!
_________________
Hardworkingly, you like my post, so kudos me.
|
|
|
|
|
|
Intern
Joined: 09 Dec 2008
Posts: 29
Location: Vietnam
Schools: Somewhere
Followers: 0
Kudos [?]:
0
[0], given: 2
|
bogos wrote: It took me 10 minutes to solve it First, it is remarked that all vouchers are equivalent. Let's call nephews A, B, C, D and their number of vouchers (2+a), (2+b), (2+c), and (2+d), respectively, where a, b, c, d non negative integers (since each of them has at least 2 vouchers). If n is the total number of vouchers, then: a+b+c+d=n-8 or a+b+c+d=m with m=n-8 Let X=a+b and Y=c+d so X+Y=m and (m+1) possible couples are (X=0, Y=m), (X=1, Y=m-1), ..., (X=m, Y=0) On the other hand, (a, b) such that a+b=k and a,b>=0, the number of such couples is equal to k+1. Therefore, generic solution is: 1*(m+1)+2*m+3*(m-1)+...+m*2+(m+1)*1 To get 120 different ways, m equals to 7, or n=15, thus C. Sure this is not the easiest way to deal with this problem! Anyway, this is a good way to solve this tough problem! Thanks
|
|
|
|
|
|
Manager
Joined: 20 Mar 2010
Posts: 85
Followers: 2
Kudos [?]:
35
[2] , given: 1
|
2
This post received
KUDOS
bogos wrote: It took me 10 minutes to solve it First, it is remarked that all vouchers are equivalent. Let's call nephews A, B, C, D and their number of vouchers (2+a), (2+b), (2+c), and (2+d), respectively, where a, b, c, d non negative integers (since each of them has at least 2 vouchers). If n is the total number of vouchers, then: a+b+c+d=n-8 or a+b+c+d=m with m=n-8 Let X=a+b and Y=c+d so X+Y=m and (m+1) possible couples are (X=0, Y=m), (X=1, Y=m-1), ..., (X=m, Y=0) On the other hand, (a, b) such that a+b=k and a,b>=0, the number of such couples is equal to k+1. Therefore, generic solution is: 1*(m+1)+2*m+3*(m-1)+...+m*2+(m+1)*1 To get 120 different ways, m equals to 7, or n=15, thus C. Sure this is not the easiest way to deal with this problem! Actually there is a formula for this 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 = n+r-1Cr-1. Here if each nephew gets at least 2 tickets we have n-8 tickets left to distribute among 4 nephews and each one of them can receive 0,1,2..n-8 items. Total no of ways that can happen = (n-8)+(4-1)C(4-1) = n-5C3 n-5C3=120 for n=15 .So C
_________________
___________________________________
Please give me kudos if you like my post
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11565
Followers: 1796
Kudos [?]:
9574
[5] , given: 826
|
5
This post received
KUDOS
dungtd wrote: 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
Could someone help me out? Thanks a lot!!! 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|tMeans 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. Answer: C (15). P.S. How to solve (k+1)(k+2)(k+3)=3!*120=720: 720, three digit integer ending with 0, is the product of three consecutive integers. Obviously one of them must be multiple of 5: try 5*6*7=210<720, next possible triplet 8*9*10=720, OK. So k+1=8 --> k=7. P.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.
_________________
PLEASE READ AND FOLLOW: 11 Rules for Posting!!!
RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory
COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!
DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!
What are GMAT Club Tests?
25 extra-hard Quant Tests
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
Intern
Joined: 09 Dec 2008
Posts: 29
Location: Vietnam
Schools: Somewhere
Followers: 0
Kudos [?]:
0
[0], given: 2
|
Bunuel wrote: dungtd wrote: 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
Could someone help me out? Thanks a lot!!! 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|tMeans 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. Answer: C (15). P.S. How to solve (k+1)(k+2)(k+3)=3!*120=720: 720, three digit integer ending with 0, is the product of three consecutive integers. Obviously one of them must be multiple of 5: try 5*6*7=210<720, next possible triplet 8*9*10=720, OK. So k+1=8 --> k=7. P.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. Thanks for your great explanation!
|
|
|
|
|
|
Senior Manager
Joined: 20 Dec 2010
Posts: 261
Schools: UNC Duke Kellogg
Followers: 3
Kudos [?]:
18
[0], given: 4
|
5 stars for the "stars and bars" method! The coolest trick ever!
|
|
|
|
|
|
Manager
Joined: 11 Apr 2011
Posts: 110
Followers: 0
Kudos [?]:
15
[0], given: 16
|
really great trick!!
|
|
|
|
|
|
Intern
Joined: 28 Mar 2011
Posts: 34
Followers: 0
Kudos [?]:
1
[0], given: 0
|
Hi Bunuel,
Why do we assume k=5?
What would happen if we assume some other value of k?
Thanks!
|
|
|
|
|
|
Manager
Joined: 13 Oct 2012
Posts: 79
Concentration: General Management, Leadership
GMAT 1: 760 Q49 V46
Followers: 1
Kudos [?]:
-17
[0], given: 0
|
this formula is worth remembering:-
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 = n+r-1Cr-1.
Thanks a lot
|
|
|
|
|
|
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 3111
Location: Pune, India
Followers: 571
Kudos [?]:
2009
[1] , given: 92
|
1
This post received
KUDOS
dungtd wrote: 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
Could someone help me out? Thanks a lot!!! This question is a spin on 'distribute n identical things among m people (some people may get none)' Since she must give each of the 4 nephews atleast 2 vouchers, she must have atleast 8. But she can split the vouchers in 120 ways so she certainly has more than 8. Let's assume she gives 2 to each nephew and has the leftover vouchers in her hand. This becomes your standard 'distribute n identical things among m people (some people may get none)' question. Assume the answer is 15 (it's in the middle) and she has 15 - 8 = 7 vouchers left in her hand. In how many ways can she distribute them among 4 people? In 10!/7!*3! = 10*9*8/(3*2) = 120 ways. This is the required answer so (C) This concept is explained in detail here: http://www.veritasprep.com/blog/2011/12 ... 93-part-1/Check method II or question 2 on the link above. Note: Say, you had obtained a number less than 120. You would have assumed 16 next and repeated the calculation. Had you obtained a number more than 120, you would have assumed 13 or 14 and done the calculation. 2 iterations would have certainly given you the answer.
_________________
Karishma
Veritas Prep | GMAT Instructor
My Blog
Save 10% on Veritas Prep GMAT Courses And Admissions Consulting
Enroll now. Pay later. Take advantage of Veritas Prep's flexible payment plan options.
Veritas Prep Reviews
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
close
