Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack

 It is currently 24 May 2017, 20:17

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

Halle, Julia and Drew have 5 donuts to share. If one of them

Author Message
TAGS:

Hide Tags

Intern
Joined: 10 May 2004
Posts: 20
Location: USA
Followers: 0

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

Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

13 Oct 2004, 22:04
7
This post was
BOOKMARKED
00:00

Difficulty:

(N/A)

Question Stats:

75% (02:07) correct 25% (04:21) wrong based on 41 sessions

HideShow timer Statistics

Halle, Julia and Drew have 5 donuts to share. If one of them can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed.

[Reveal] Spoiler:
21
Intern
Joined: 10 Oct 2004
Posts: 12
Followers: 0

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

13 Oct 2004, 22:33
these are the no of ways:

0 2 3 - 3! ways

2 2 1 - 3!/2 ways

5 0 0 - 3!/2 ways

4 1 0 - 3! ways

1 1 3 - 3!/2 ways

So total no of ways = 21
Director
Joined: 31 Aug 2004
Posts: 607
Followers: 3

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

14 Oct 2004, 03:13
Is there any tricky way which could be used if question is p donuts and n persons ?
Manager
Joined: 02 Jul 2004
Posts: 51
Followers: 0

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

16 Oct 2004, 07:51
1
KUDOS
2
This post was
BOOKMARKED
Hmmm.

This is a combinations with repetition problem.

Just have to think about it the right way. Basically we have a bag of donuts from which we will pull 5 times. Any donut removed from the bag can be a Halle, Julia, or Drew Donut.

The general formula is:
C(n+r-1,r)
n number of elements
r-combinations.

So
C(5+3-1,5) = C(7,5) = C(7,2) = 21

The way that this makes sense is if we consider aligning the 5 donuts (*) and placing separators between them to indicate to whom they belong.
So,
*****||
would indicate that Halle has all the donuts,
|*****|
would indicate that Julia has all the donuts, and
||*****
would indicate that Drew has all the donuts.

So the answer is the number of ways to pick the 5 *'s or the 2 |'s out of the set of 7.

Thomas
Manager
Joined: 24 Aug 2004
Posts: 66
Followers: 1

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

17 Oct 2004, 00:02
1
KUDOS
2
This post was
BOOKMARKED
tygel, this is a great logic

Extending this logic further can also be used to solve problems like these:

1. In how many ways can 20 be expressed as sum of 5 non negative integers.

using similar logic : you have 20 *s are 4 seperators '|' and u have to chose 4 '|' and u can do that in 24C4 ways.

TO add to this twist, in how many ways can the number 20 be written as a sum of 5 positive integers?
you have 20 *'s and u have to place 4 '|' in between them, i.e. no of ways in which 4 '|' can be placed in 19 places, where all '|' are identical. 19C4.

To summarise, no of ways in which n things can be divided among r persons so that each of them can receive 0 or more is n+r-1Cr-1. In tapsemi's Q. n= 5, r = 3, so reqd ways = 7C2 = 21.

and no of ways in which n things can be divided among r persons so that each of them receive at least 1 is n-1Cr-1
Manager
Joined: 02 Jul 2004
Posts: 51
Followers: 0

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

17 Oct 2004, 11:09
This brings up an interesting question ...

If the question were ...

Given

x_1 + x_2 + x_3 = 6

How many positive solutions are there where x_1, x_2, and x_3 are all positive numbers.

Then the equation you gave works ...

(6-3+3-1)C2 => 5C2 => 10

We can see this is true by listing out the 10 solutions (x_1,x_2,x_3):

1, 1, 4
1, 4, 1
4, 1, 1
1, 2, 3
1, 3, 2
2, 1, 3
2, 3, 1
3, 1, 2
3, 2, 1
2, 2, 2

However, if the question were how many ways can 3 postive numbers be added to form 6 the answer is different.

There are only 3 unique solutions
1, 1, 4 (3 permutation)
1, 2, 3 (6 permutation)
2, 2, 2 (1 permutation)

Anyone care to take a stab at the general solution for that one?

Thomas
Director
Joined: 31 Aug 2004
Posts: 607
Followers: 3

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

19 Oct 2004, 08:10
Thank you target and tyagel for your inputs !
Manager
Joined: 05 Jul 2009
Posts: 182
Followers: 1

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

17 Sep 2009, 16:27
Thanks!!!

What would be the case if the donuts are considered different from each other? Is this the same?
VP
Status: There is always something new !!
Affiliations: PMI,QAI Global,eXampleCG
Joined: 08 May 2009
Posts: 1334
Followers: 17

Kudos [?]: 254 [2] , given: 10

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

02 May 2011, 09:24
2
KUDOS
n things to be divided among 3 people so that each gets from 0-n = C(n+r-1, r-1) = 21
_________________

Visit -- http://www.sustainable-sphere.com/
Promote Green Business,Sustainable Living and Green Earth !!

GMAT Club Legend
Joined: 09 Sep 2013
Posts: 15432
Followers: 649

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

08 Aug 2015, 13:40
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Manager
Joined: 23 Sep 2015
Posts: 97
Concentration: General Management, Finance
GMAT 1: 680 Q46 V38
GMAT 2: 690 Q47 V38
GPA: 3.5
Followers: 0

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

Re: Halle, Julia and Drew have 5 donuts to share. If one of them [#permalink]

Show Tags

24 Oct 2015, 09:30
tapsemi wrote:
Halle, Julia and Drew have 5 donuts to share. If one of them can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed.

[Reveal] Spoiler:
21

Can someone provide a more clear solution to this problem?

I read the posts but not understanding how to interpret this question and also where the formula comes from to solve this question

C(n+r-1,r)

n= # of elements
r = combinations
Re: Halle, Julia and Drew have 5 donuts to share. If one of them   [#permalink] 24 Oct 2015, 09:30
Similar topics Replies Last post
Similar
Topics:
3 A box contains one dozen donuts. Four of the donuts are chocolate, fou 3 30 Mar 2016, 14:36
3 A box contains one dozen donuts. Four of the donuts are 4 01 Dec 2016, 11:43
40 Larry, Michael, and Doug have five donuts to share. If any 15 08 Mar 2017, 22:42
The table shows the number of shares of each of the 5 stocks 4 24 Aug 2010, 09:20
9 Larry, Michael, and Doug have five donuts to share. If any one of the 12 07 Oct 2016, 01:10
Display posts from previous: Sort by