BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach Starts Oct 17
Chris Peckover, Target Test Prep GMAT expert
LIVE ONLINE CLASSES

Get Ready for GMAT Test Day Faster with Live Online Classes

with Chris Peckover, 100th-Percentile GMAT Scorer

Oct 17 · Chris Peckover
Sat · 11:00 AM to 2:00 PM ET
Oct 20 · Chris Peckover
Tue, Thu · 8:00 to 10:00 PM ET
Oct 25 · Josh Braslow
Sun · 1:00 to 4:00 PM ET
Included
40 hours of live online classes + 6 months of TTP OnDemand
  • Attend the first class for free
  • Every class is recorded, so you never fall behind
View classes & enroll
Limited seats availableTarget Test Prep
EALiveTeachOnDemand 5 seats left Start anytime
EXECUTIVE ASSESSMENT

Target Test Prep EA OnDemand

Self-paced EA prep. Study on your schedule.

Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

165+ EA score guarantee
$05-day trial no automatic billing
Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll Start free 5-day trial
Limited cohort · enrollment openTrial includes full course accessTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Candies

Expert replies
by manik11 » Sat Apr 09, 2016 4:46 am
If a jar of candies is divided among 3 children, how many candies did the child that received the fewest pieces receive?
(1) The two children that received the greatest number of pieces received a total of 13 pieces.
(2) The two children that received the fewest number of pieces received a total of 11 pieces

OA : C
Source : Bell Curves
Join the discussion
Source: — Data Sufficiency |

by MartyMurray » Sat Apr 09, 2016 5:16 am
Statement 1: The two children that received the greatest number of pieces received a total of 13 pieces.

This tells us that the minimum number of pieces received by the the child who received the greatest number is 7, in which case the one who got the second most would have gotten 6 pieces. The one who got the least could also have gotten 6 or could have gotten fewer than 6.

Insufficient.

Statement 2:

Since 6 + 5 = 11, this tells us that the minimum the child who received the second fewest pieces could have received is 6, because the second fewest pieces has to be greater than the fewest pieces. However other combinations are possible, combinations such as 7 and 4 and 8 and 3.

Insufficient.

Combined the statements tell us the following.

From Statement 1, if the minimum number of pieces received by the child who got the most is 7, because 6 + 7 = 13 and because the second most has to be fewer than the most, the maximum received by the child who got the second most is 6.

From Statement 2 we know that the minimum value of the second most is 6.

So the value of the second most has to be 6.

From Statement 2 we know that the second most + the least = 11. 11 - 6 = 5 = the number received by the child who received the fewest.

Sufficient.

The correct answer is C.
Last edited by MartyMurray on Sat Apr 09, 2016 7:01 am, edited 1 time in total.
Marty Murray
Perfect Scoring Tutor With Over a Decade of Experience
MartyMurrayCoaching.com
Contact me at [email protected] for a free consultation.
Join the discussion

by didieravoaka » Sat Apr 09, 2016 6:36 am
Yes! I got it right Marty. They are in the order 5 (the fewest)-6-7
Join the discussion

by [email protected] » Sat Apr 09, 2016 9:03 am
Hi manik11,

Sometimes the easiest way to answer a Quant question is to 'play around' with it and use 'brute force' to get to the solution. This type of approach is often applicable when the number of 'possibilities' is limited.

Here, we're told that a certain number of candies is divided among 3 children. We're asked to figure out the number candies that went to the child who received the LEAST number of candies.

1) The two children that received the greatest number of pieces received a total of 13 pieces.

Based on this Fact, the number of pieces received by these 2 children could have been...
11 and 2
10 and 3
9 and 4
8 and 5
7 and 6

No other options are possible (remember that there's a 3rd child who received at least one piece of candy, so this list CAN'T have 12 and 1 on it, otherwise the 3rd child - the one who received the LEAST - would receive 0 pieces and that's NOT an option). Given this list of options, the child who received the least number of pieces would have gotten from 1 - 5 pieces, but we don't know exactly how many from this information.
Fact 1 is INSUFFICIENT.

2) The two children that received the fewest number of pieces received a total of 11 pieces

From this Fact, we can create a similar list, but now we're tracking the two children who received the 'lower 2' numbers:

1 and 10
2 and 9
3 and 8
4 and 7
5 and 6

From these options, the child who received the least would have received form 1 - 5 pieces, but we still don't know how many pieces exactly.
Fact 2 is INSUFFICIENT

Combined, we need to 'match' one of the options from the second list with an option from the first list that allows for both "sub-totals" (the 13 and the 11). Starting from the 2nd list - the one that contains the two SMALLER numbers...

1 and 10 doesn't work (the biggest would be "3" and that's no mathematically possible).
2 and 9 doesn't work (the biggest would be "4" and that's no mathematically possible).
3 and 8 doesn't work (the biggest would be "5" and that's no mathematically possible).
4 and 7 doesn't work (the biggest would be "6" and that's no mathematically possible).

5 and 6 DOES work though (the biggest would be "7" and that IS mathematically possible. This is the ONLY possible solution.
Combined, SUFFICIENT.

Final Answer: C

GMAT assassins aren't born, they're made,
Rich
Contact Rich at [email protected]
Image
Join the discussion

by Matt@VeritasPrep » Mon Apr 11, 2016 1:30 pm
Let's say that the kids got x, y, and z candies each, where x ≥ y ≥ z.

S1:

x + y = 13

S2:

y + z = 11

Working with the two together, we know that x - z = 2, so the kid who got the most candies got TWO MORE than the kid who got the least.

We also know that the three kids must each have gotten a different number of candies, since

Odd + Even = 13

Even + Odd = 11

That means that y must = x - 1, leaving us with

x = x
y = x - 1
z = x - 2

and three consecutive integers, with a unique solution of x = 7, y = 6, and z = 5.
Join the discussion