Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2601:30 AM EDT
-02:30 AM EDT
Learn how Keshav, a Chartered Accountant, scored an impressive 705 on GMAT in just 30 days with GMATWhiz's expert guidance. In this video, he shares preparation tips and strategies that worked for him, including the mock, time management, and more.
Apr 2711:00 AM EDT
-12:00 PM EDT
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
May 0111:00 AM PDT
-12:00 PM PDT
Free- full-length test + 15 concept videos + 150+ short videos + study plan!
02 May 2025, 00:30
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
65%
(hard)
Question Stats:
60% (02:02) correct
40%
(01:52)
wrong
based on 299
sessions
History
Date
Time
Result
Not Attempted Yet
A child had 5 friends at her birthday party. The children opened a box containing 21 pieces of candy. Each piece of candy was received by a child. There were no other pieces of candy received by the children at the party. Did each child at the party receive at least 1 piece of candy from the box?
(1) Each child received a different number of candies.
(2) The birthday girl received 6 pieces of candy, which was more than any other child.
(1) Each child received a different number of candies.
(2) The birthday girl received 6 pieces of candy, which was more than any other child.
05 May 2025, 07:06
Kudos
Bookmarks
For the second option we can also 0,0,5,5,5,6 apart from 1,2,3,4,5,6?
06 May 2025, 06:44
Kudos
Bookmarks
My 2c
(1) alone: possible combinations where the numbers are different:
To see if this is sufficient, I’m trying to find two combination,s one that has a zero and one that does not have any
0,1,2,3,15 or 1,2,3,4,11
=> not sufficient
(2) alone: possible combinations where the sun must be 15:
0,1,2,3,9 or 1,2,3,4,5
(The numbers don’t have to be necessarily different)
=> not sufficient
(1) and (2) together: same as above, I’m trying to find if there are two combinations where the numbers are different and they sum up to be equal to 15.
The two combinations that I’m looking for are one without zeros and one with only one zero. We’re looking for only one zero and not two because the numbers have to be distinct.
- Now, if I wanna find a combination, I need to know the rules by which I’m playing, and therefore my brain goes to the possible pool of numbers that I can pick from is 5,4,3,2,1
I need to pick five of those numbers. Coincidentally, if I sum all of them, I get 15, so I can use this as my first combination.
Now, let’s say I did not think of the pool of numbers available to me, and I went with a different approach. A more “generalised” approach.
I start with a middle ground (15/5=3 for each)
3,3,3,3,3 (the sum has to be the same, so if I add +1 to one of the numbers, I have to also subtract 1 from another. That would also help me find different numbers.)
3+1,3-1,3+2,3-2,3
4,2,5,1,3
This is my first combination, and no number is equal to or greater than six, and they’re all different.
Another approach here is to start with the biggest number possible and subtract one, and arrange accordingly.
- Now I wanna find a combination that has one zero in it.
0,x,x,x,x. Now this one might be a little bit more complicated, so let’s look at all the possible numbers that we can choose from: 1,2,3,4,5
Now I realise that if I need to pick four of those numbers and their sum needs to be 15, I cannot achieve that. Let’s pick the four biggest numbers. 5+4+3+2=14 I am missing one, and of course, any other combination is gonna be even smaller
Therefore, I can’t have a combination where one of the five receives zero candies.
So one and two together are sufficient => C
(1) alone: possible combinations where the numbers are different:
To see if this is sufficient, I’m trying to find two combination,s one that has a zero and one that does not have any
0,1,2,3,15 or 1,2,3,4,11
=> not sufficient
(2) alone: possible combinations where the sun must be 15:
0,1,2,3,9 or 1,2,3,4,5
(The numbers don’t have to be necessarily different)
=> not sufficient
(1) and (2) together: same as above, I’m trying to find if there are two combinations where the numbers are different and they sum up to be equal to 15.
The two combinations that I’m looking for are one without zeros and one with only one zero. We’re looking for only one zero and not two because the numbers have to be distinct.
- Now, if I wanna find a combination, I need to know the rules by which I’m playing, and therefore my brain goes to the possible pool of numbers that I can pick from is 5,4,3,2,1
I need to pick five of those numbers. Coincidentally, if I sum all of them, I get 15, so I can use this as my first combination.
Now, let’s say I did not think of the pool of numbers available to me, and I went with a different approach. A more “generalised” approach.
I start with a middle ground (15/5=3 for each)
3,3,3,3,3 (the sum has to be the same, so if I add +1 to one of the numbers, I have to also subtract 1 from another. That would also help me find different numbers.)
3+1,3-1,3+2,3-2,3
4,2,5,1,3
This is my first combination, and no number is equal to or greater than six, and they’re all different.
Another approach here is to start with the biggest number possible and subtract one, and arrange accordingly.
- Now I wanna find a combination that has one zero in it.
0,x,x,x,x. Now this one might be a little bit more complicated, so let’s look at all the possible numbers that we can choose from: 1,2,3,4,5
Now I realise that if I need to pick four of those numbers and their sum needs to be 15, I cannot achieve that. Let’s pick the four biggest numbers. 5+4+3+2=14 I am missing one, and of course, any other combination is gonna be even smaller
Therefore, I can’t have a combination where one of the five receives zero candies.
So one and two together are sufficient => C
