Find all School-related info fast with the new School-Specific MBA Forum

It is currently 23 Jul 2014, 10:04

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Larry, Michael, and Doug have five donuts to share. If any

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Intern
Intern
avatar
Joined: 10 Jan 2006
Posts: 25
Followers: 0

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

Larry, Michael, and Doug have five donuts to share. If any [#permalink] New post 19 May 2006, 22:22
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


In general this problem can take multiple forms
1. how many ways can u separate N numbered balls (1..N) into X buckets
2. How many ways can u separate N identical balls into X buckets.
3. How many ways can u add X numbers to get N as the sum where
a) 1 or more numbers can be 0
b) Each number is > 0.
Senior Manager
Senior Manager
avatar
Joined: 09 Mar 2006
Posts: 445
Followers: 1

Kudos [?]: 6 [0], given: 0

GMAT Tests User
 [#permalink] New post 20 May 2006, 03:52
The simplest aproach for this kind of problem that I am aware of would be to add (X -1) separators to the bunch of Y objects that you want to distribute among X people.

For instance, in your current question, the permutation that looks like OO|O|OO means that Larry got 2 , Michael got 1 and Doug got 2 donuts.

Hence the formula: (Y + X - 1 )! / ( Y! * (X-1)! )
You have to divide by ( Y! * (X-1)! ) since the separators and distributed objects are identical.

So the answer is 7!/(2!*5!) = 21

1) This problem is different, so its approach is different as well. Since each
ball can go to one of X baskets, total number of distributions will be:
X^N

2) This one is a general case of the problem explained in the beginning of this post.

3) I am not sure I understood this question. Please explain.
Intern
Intern
avatar
Joined: 10 Jan 2006
Posts: 25
Followers: 0

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

 [#permalink] New post 20 May 2006, 07:05
deowl wrote:

3) I am not sure I understood this question. Please explain.


Should have been obvious.

Anyway.

3a) How many ways can we get distinct non-negative integers (x1,x2,x3,x4...xr) such that x1+x2+x3..xr = N where N is another distinct non-negative number.

Solved the same way as separating N identical balls into R urns.

b) Here we just add the condition that x1,x2,x3 are all greater than 0.

We can again solve this as the urns+balls problem i.e the number of ways of placing N balls into R urns with each urn having at least one ball. Keep the N balls in a row. We get N-1 spots between the balls which is a demarcator. We'll now choose (R-1) spots from the N-1 spots.


Answer is (n-1)C(r-1) i.e (n-1)!/(n-r)!(r-1)!
1 KUDOS received
VP
VP
User avatar
Joined: 29 Dec 2005
Posts: 1351
Followers: 6

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

GMAT Tests User
Re: Worth revising once [#permalink] New post 20 May 2006, 09:28
1
This post received
KUDOS
saha 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


(1) 5-0-0 in 3!/2! or 3 ways.
(2) 4-1-0 in 3! or 6 ways
(3) 3-1-1 in 3!/2 or 3 ways
(4) 3-2-0 in 3! or 6 ways
(5) 2-2-1 in 3!/2 or 3 ways

21 ways..
Re: Worth revising once   [#permalink] 20 May 2006, 09:28
    Similar topics Author Replies Last post
Similar
Topics:
Larry, Michael, and Doug have five donuts to share PrateekDua 0 29 Sep 2013, 02:46
12 Experts publish their posts in the topic Larry, Michael, and Doug have five donuts to share. If any rxs0005 13 04 Feb 2011, 15:05
Larry, Michael, and Doug have five donuts to share. If any AK 7 28 Dec 2006, 22:31
Five students Joe, Katy, Lori, Michael and Natasha must minhthel 6 23 Jul 2006, 00:08
3 Halle, Julia and Drew have 5 donuts to share. If one of them tapsemi 8 13 Oct 2004, 21:04
Display posts from previous: Sort by

Larry, Michael, and Doug have five donuts to share. If any

  Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.