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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

In how many ways can all the 7 sweets be distributed to [#permalink]

Show Tags

06 Jan 2005, 10:50

6

This post was BOOKMARKED

00:00

A

B

C

D

E

Difficulty:

(N/A)

Question Stats:

81% (01:59) correct
19% (00:31) wrong based on 100 sessions

HideShow timer Statistics

In how many ways can all the 7 sweets be distributed to three friends Jack, Jill, John so that Jill always gets 2 sweets and each of them gets at least one sweet
A) 24
B) 6
C) 4
D) 12
E) 3

I get 8 but then I dont see that in the answers, so maybe I am counting twice.

nocilis wrote:

In how many ways can all the 7 sweets be distributed to three friends Jack, Jill, John so that Jill always gets 2 sweets and each of them gets at least one sweet A) 24 B) 6 C) 4 D) 12 E) 3

Is there a mathematical way to solve this problem, for instance what if the number of sweets to be distributed was 15 and there might be more than just 3 members with some conditions on minimum distributions etc. Is there a way to solve it then ?

In how many ways can all the 7 sweets be distributed to three friends Jack, Jill, John so that Jill always gets 2 sweets and each of them gets at least one sweet A) 24 B) 6 C) 4 D) 12 E) 3

I doubt the question sentence framing. Jill always gets 2 sweets and "each of them gets at least one". Each of them...gets...at least...one!!!! Is Jill being counted again? Jill is given off 2 sweets and isn't she happy ever? Does she demand at least one sweet of the remaining five? Are the five sweets supposed to be distributed to each of them (three??) so that every one gets at least one sweet??

Where was this question even picked? Please don't follow useless sources such as these. _________________

Essentially, this problem can be rewritten as 5 sweets being distributed among Jack and John, with each of them getting at least 1.

You really only need to focus on one person, since whatever Jack gets, John will get the rest. So for Jack there are 4C1 ways (1 to 4 sweets) his total can be distributed, and the remaining goto John. Therefore 4 total ways.

Part 2 of the GMAT: How I tackled the GMAT and improved a disappointing score Apologies for the month gap. I went on vacation and had to finish up a...

I’m a little delirious because I’m a little sleep deprived. But whatever. I have to write this post because... I’M IN! Funnily enough, I actually missed the acceptance phone...

So the last couple of weeks have seen a flurry of discussion in our MBA class Whatsapp group around Brexit, the referendum and currency exchange. Most of us believed...

This highly influential bestseller was first published over 25 years ago. I had wanted to read this book for a long time and I finally got around to it...