February 23, 2019 February 23, 2019 07:00 AM PST 09:00 AM PST Learn reading strategies that can help even nonvoracious reader to master GMAT RC. Saturday, February 23rd at 7 AM PT February 24, 2019 February 24, 2019 07:00 AM PST 09:00 AM PST Get personalized insights on how to achieve your Target Quant Score.
Author 
Message 
TAGS:

Hide Tags

Director
Joined: 07 Jun 2004
Posts: 589
Location: PA

Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
04 Feb 2011, 15:05
Question Stats:
57% (01:58) correct 43% (02:09) wrong based on 526 sessions
HideShow timer Statistics
Larry, Michael, and Doug have five donuts to share. If any one of the men can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed? (A) 21 (B) 42 (C) 120 (D) 504 (E) 5040
Official Answer and Stats are available only to registered users. Register/ Login.




Math Expert
Joined: 02 Sep 2009
Posts: 53066

Re: Combinations tough
[#permalink]
Show Tags
04 Feb 2011, 15:20
rxs0005 wrote: Larry, Michael, and Doug have five donuts to share. If any one of the men can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed?
(A) 21 (B) 42 (C) 120 (D) 504 (E) 5040 Consider this: we have 5 donuts \(d\) and 2 separators \(\), like: \(ddddd\). How many permutations (arrangements) of these symbols are possible? Total of 7 symbols (5+2=7), out of which 5 \(d\)'s and 2 \(\)'s are identical, so \(\frac{7!}{5!2!}=21\). We'll get combinations like: \(ddddd\) this would mean that Larry got 2 donuts, Michael got 1 donut and Doug got 2 donuts, so to the left of the first separator are Larry's donuts, between the separators are Michael's donuts and to the right of the second separator are Doug's donuts Answer: A. This can be done with direct formula as well: The total number of ways of dividing n identical items (5 donuts in our case) among r persons or objects (3 persons in our case), each one of whom, can receive 0, 1, 2 or more items (from zero to 5 in our case) is \({n+r1}_C_{r1}\). In our case we'll get: \({n+r1}_C_{r1}={5+31}_C_{31}={7}C2=\frac{7!}{5!2!}=21\). Similar question: integerslessthan85291.html#p710836
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
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. ,11 Mixed Questions, 12 Fresh Meat 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., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics




Current Student
Joined: 23 May 2013
Posts: 186
Location: United States
Concentration: Technology, Healthcare
GPA: 3.5

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
05 Mar 2014, 10:51
If you get confused about combinations, there's a simple way to count these combinations as well, by counting the number of ways 5 can be summed with 3 numbers.
{5,0,0} = 3 possibilities. {4,1,0} = 6 possibilities. {3,2,0} = 6 possibilities. {3,1,1} = 3 possibilities. {2,2,1} = 3 possibilities. Total = 21 possibilities.
Tip: For each set, we only have to consider numbers less than the first; for instance, we wouldn't consider {2,3,0} because that's already accounted for in a permutation of {3,2,0}




Manager
Joined: 02 Jan 2013
Posts: 57
GPA: 3.2
WE: Consulting (Consulting)

Larry, Michael, and Doug have five donuts to share. If any one o
[#permalink]
Show Tags
17 Jan 2013, 08:17
Another awesome variation to this question (the one mentioned above) would be:
How many integer solutions (x,y,z) are there to the equation: x+y+z = 20, where x is at least equal to 3, y is at least equal to 4, and z is at least equal to 5



Manager
Joined: 18 Oct 2011
Posts: 86
Location: United States
Concentration: Entrepreneurship, Marketing
GMAT Date: 01302013
GPA: 3.3

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
17 Jan 2013, 10:56
should it not state identical donuts to share? relatively straightforward question but got confused as to whether we needed to use combinations formula and then arrange between the 3 people



Manager
Joined: 06 Feb 2013
Posts: 53

Re: Combinations tough
[#permalink]
Show Tags
03 Sep 2013, 07:05
Bunuel wrote: rxs0005 wrote: Larry, Michael, and Doug have five donuts to share. If any one of the men can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed?
(A) 21 (B) 42 (C) 120 (D) 504 (E) 5040 Consider this: we have 5 donuts \(d\) and 2 separators \(\), like: \(ddddd\). How many permutations (arrangements) of these symbols are possible? Total of 7 symbols (5+2=7), out of which 5 \(d\)'s and 2 \(\)'s are identical, so \(\frac{7!}{5!2!}=21\). We'll get combinations like: \(ddddd\) this would mean that Larry got 2 donuts, Michael got 1 donut and Doug got 2 donuts, so to the left of the first separator are Larry's donuts, between the separators are Michael's donuts and to the right of the second separator are Doug's donuts Answer: A. This can be done with direct formula as well: The total number of ways of dividing n identical items (5 donuts in our case) among r persons or objects (3 persons in our case), each one of whom, can receive 0, 1, 2 or more items (from zero to 5 in our case) is \({n+r1}_C_{r1}\). In our case we'll get: \({n+r1}_C_{r1}={5+31}_C_{31}={7}C2=\frac{7!}{5!2!}=21\). Similar question: integerslessthan85291.html#p710836Bunuel  could you explain how this problem would sound if I used a simple counting principle like Larry can get 5 doughnuts Michael 4...all the way to have 5! and therefore I would get 5!= 120, which would obviously be too easy but I am a little confused as to the difference in wording. Solution and those dividers make good sense, so thanks for that.
_________________
There are times when I do not mind kudos...I do enjoy giving some for help



Intern
Joined: 12 Sep 2012
Posts: 25

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
03 Jul 2014, 08:07
Dear Bunuel, Thanks for the great explanation. But there is a catch that is not clear to me. I read all other similar types of questions and also went through the explanations given by you. There you have used 3 separators for all the cases but here you have used 2. Could you tell me how would I know that how many separators should I use. Thanks in advance.



Math Expert
Joined: 02 Sep 2009
Posts: 53066

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
05 Jul 2014, 06:09



Intern
Joined: 18 Jun 2014
Posts: 3

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
06 Jul 2014, 04:50
Why 3^5 is not a correct answer? Considering each donut has 3 possibilities(L,M &D)... Kindly regards



Math Expert
Joined: 02 Sep 2009
Posts: 53066

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
06 Jul 2014, 09:29



Intern
Joined: 14 Dec 2010
Posts: 2
Schools: ISB

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
19 Nov 2014, 08:59
Keep in mind that 2 people might not even get any donuts at all.. so total 7! and 5 donuts are identical and 2 not given are identical .. so 7!/ 5! 2! = 21



Director
Joined: 03 Feb 2013
Posts: 846
Location: India
Concentration: Operations, Strategy
GPA: 3.88
WE: Engineering (Computer Software)

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
20 Dec 2014, 09:53
L + M + D = 5 As L,M,D >= 0 We need to distribute 5 donots and 2 empty vessels. So 7!/(5!*2!) or 7C2 = 21  A)
_________________
Thanks, Kinjal My Debrief : http://gmatclub.com/forum/hardworknevergetsunrewardedforever189267.html#p1449379 My Application Experience : http://gmatclub.com/forum/hardworknevergetsunrewardedforever18926740.html#p1516961 Linkedin : https://www.linkedin.com/in/kinjaldas/
Please click on Kudos, if you think the post is helpful



Intern
Status: Studying
Joined: 18 Jan 2012
Posts: 8
Work: Manager

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
13 Jan 2016, 01:33
This problem similar to:
In how many ways can 3 distinct rings be worn on 4 fingers? (each finger can contain 03 rings)
OR
In how many ways can 3 distinct letters be distributed among 4 letterboxes? (each letterbox can contain 03 letters)
The solution to this problem is given as 4^3, as you have 3 slots (each slot representing a ring or a letter) and each slot can have 4 possibilities
4 4 4 = 4^3
Yet, the 3^5 does not work in the case of the donut. Please explain.



Intern
Joined: 22 Jun 2015
Posts: 8

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
13 Jul 2017, 08:46
Can someone please explain this separator method? Or can anyone post a link where it is explained? I dont understand this solution



Target Test Prep Representative
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 4955
Location: United States (CA)

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
16 Jul 2017, 16:37
rxs0005 wrote: Larry, Michael, and Doug have five donuts to share. If any one of the men can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed?
(A) 21 (B) 42 (C) 120 (D) 504 (E) 5040 Let D be a donut, so we have DDDDD to distribute among three people. Also, we can use “” as a separator, and we need two of them since there are three people. For example, DDDDD means Larry gets 1 donut, Michael 3, and Doug 1, and DDDDD means Larry gets 5 donuts, Michael 0, and Doug 0. Thus, the problem becomes how many ways we can arrange 5 Ds and 2 strokes. To solve it, we can use the formula for permutation of indistinguishable objects: 7!/(5! x 2!) = (7 x 6 x 5!)/(5! x 2) = 42/2 = 21 Answer: A
_________________
Scott WoodburyStewart
Founder and CEO
GMAT Quant SelfStudy Course
500+ lessons 3000+ practice problems 800+ HD solutions



Senior Manager
Joined: 28 Jun 2015
Posts: 290
Concentration: Finance
GPA: 3.5

Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
16 Jul 2017, 18:59
\(0+1+4\)  this can be done in \(6\) ways: \(014, 104,401,140,410,041\) \(1+1+3\)  this can be done in \(3\) ways: \(\frac{3!}{2!}\) \(1+2+2\)  this can be done in \(3\) ways: \(\frac{3!}{2!}\) \(2+3+0\)  this can be done in \(6\) ways \(0+0+5\)  this can be done in \(3\) ways Total no. of ways = \(6+3+3+6+3 = 21.\)
_________________
I used to think the brain was the most important organ. Then I thought, look what’s telling me that.



Senior Manager
Joined: 21 Aug 2016
Posts: 261
Location: India
GPA: 3.9
WE: Information Technology (Computer Software)

Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
Show Tags
29 Dec 2017, 09:10
Bunuel wrote: rxs0005 wrote: Larry, Michael, and Doug have five donuts to share. If any one of the men can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed?
(A) 21 (B) 42 (C) 120 (D) 504 (E) 5040 Consider this: we have 5 donuts \(d\) and 2 separators \(\), like: \(ddddd\). How many permutations (arrangements) of these symbols are possible? Total of 7 symbols (5+2=7), out of which 5 \(d\)'s and 2 \(\)'s are identical, so \(\frac{7!}{5!2!}=21\). We'll get combinations like: \(ddddd\) this would mean that Larry got 2 donuts, Michael got 1 donut and Doug got 2 donuts, so to the left of the first separator are Larry's donuts, between the separators are Michael's donuts and to the right of the second separator are Doug's donuts Answer: A. This can be done with direct formula as well: The total number of ways of dividing n identical items (5 donuts in our case) among r persons or objects (3 persons in our case), each one of whom, can receive 0, 1, 2 or more items (from zero to 5 in our case) is \({n+r1}_C_{r1}\). In our case we'll get: \({n+r1}_C_{r1}={5+31}_C_{31}={7}C2=\frac{7!}{5!2!}=21\). Similar question: http://gmatclub.com/forum/integersless ... ml#p710836Hi BunuelHow do we identify that these donuts are not distinct? It is not explicitly mentioned in the question. If not explicitly stated, what should we assume (are they distinct or identical)?




Re: Larry, Michael, and Doug have five donuts to share. If any
[#permalink]
29 Dec 2017, 09:10






