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.
May 2008:00 AM PDT
-08:30 AM PDT
What’s in it for you- Live Profile Evaluation Chat Session with Jenifer Turtschanow, CEO, ARINGO. Come with your details prepared and ARINGO will share insights! Pre-MBA Role/Industry, YOE, Exam Score, C/GPA, ECs Post-MBA Role/ Industry & School List.
Jun 1006:00 AM PDT
-06:15 PM PDT
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..
msignatius
18 Dec 2025, 02:09
Kudos
Bookmarks
Let's take a look at the stem first:
If there are 82 candies in total, of which 29 are cherry, that leaves us with 53 candies that are mango and lime combined. We need to find among these how many are mango, and we do need the exact numbers here. So, no half-measures! Onto the statements:
Statement 1: Rita is not guaranteed to get 1 candy of each flavor until she reaches 69 candies. What is this even trying to say? This means, that by the time we've picked 69 candies, we've run out of 2 of the 3 flavors, in fact right at the 68th candy. This means the remaining candy flavor, will be 82 - 68 = 14 in count. But that's not all. We know that Cherry is 29 in number, while 53 is mango + lime. We also know that this 53 doesn't include cherry. So, it includes the last candy, 14 in count, and another one - 53 - 14 = 39 in count.
We have the quantities of the two candies now - 14 and 39 - but we don't know which one's for lime and which one's for mango. Remember, we need an exact number of mango candies to get the answer.
Statement 1 won't be sufficient then.
Statement 2: There are fewer lime candies than mango candies. Disregarding everything in Statement 1, we can't really take this for anything. For the stem, we know there are 53 mango and lime candies. If there are fewer lime candies, there could be as low as 1 lime candy and 52 mango candies, or as much as 26 lime candies and 27 mango candies. That's a big range.
Statement 2 won't be sufficient then.
Both statements combined: We already know from our evaluation of statement one that one candy counts 14, the other 39, and statement two now adds that there are fewer lime candies than mango. So, there are 14 lime candies, and 39 mango ones. That's our answer.
Statement 1 & 2, Combined, are key to finding the answer. C.
If there are 82 candies in total, of which 29 are cherry, that leaves us with 53 candies that are mango and lime combined. We need to find among these how many are mango, and we do need the exact numbers here. So, no half-measures! Onto the statements:
Statement 1: Rita is not guaranteed to get 1 candy of each flavor until she reaches 69 candies. What is this even trying to say? This means, that by the time we've picked 69 candies, we've run out of 2 of the 3 flavors, in fact right at the 68th candy. This means the remaining candy flavor, will be 82 - 68 = 14 in count. But that's not all. We know that Cherry is 29 in number, while 53 is mango + lime. We also know that this 53 doesn't include cherry. So, it includes the last candy, 14 in count, and another one - 53 - 14 = 39 in count.
We have the quantities of the two candies now - 14 and 39 - but we don't know which one's for lime and which one's for mango. Remember, we need an exact number of mango candies to get the answer.
Statement 1 won't be sufficient then.
Statement 2: There are fewer lime candies than mango candies. Disregarding everything in Statement 1, we can't really take this for anything. For the stem, we know there are 53 mango and lime candies. If there are fewer lime candies, there could be as low as 1 lime candy and 52 mango candies, or as much as 26 lime candies and 27 mango candies. That's a big range.
Statement 2 won't be sufficient then.
Both statements combined: We already know from our evaluation of statement one that one candy counts 14, the other 39, and statement two now adds that there are fewer lime candies than mango. So, there are 14 lime candies, and 39 mango ones. That's our answer.
Statement 1 & 2, Combined, are key to finding the answer. C.
Bunuel
18 Dec 2025, 02:37
Kudos
Bookmarks
We know that \(c+m+l=82\), and \(c=29\), so \(m+l=53.\)
(1) Since the minimum random number must include full quantities of two candy types and one candy of another type, then the two possibilities are:
\(69 = 29 + 1 + m\), or \(69=29 + 1 + l\), where either limes or mangoes are taken in their full quantity.
Therefore, we must have either 39 lime candies (meaning \(53-39=14\) mango ones), or 39 mango ones. insufficient.
(2) Just knowing that within 53, there're fewer limes than mangoes, is definitely insufficient.
(1)+(2) Since there're fewer lime candies, we can easily establish that there're 39 mango ones. Sufficient.
Therefore, the answer is C.
(1) Since the minimum random number must include full quantities of two candy types and one candy of another type, then the two possibilities are:
\(69 = 29 + 1 + m\), or \(69=29 + 1 + l\), where either limes or mangoes are taken in their full quantity.
Therefore, we must have either 39 lime candies (meaning \(53-39=14\) mango ones), or 39 mango ones. insufficient.
(2) Just knowing that within 53, there're fewer limes than mangoes, is definitely insufficient.
(1)+(2) Since there're fewer lime candies, we can easily establish that there're 39 mango ones. Sufficient.
Therefore, the answer is C.
SSWTtoKellogg
Joined: 06 Mar 2024
Last visit: 15 May 2026
Posts: 91
Given Kudos: 20
Location: India
Schools: INSEAD Jan '27
GMAT Focus 1: 595 Q83 V78 DI77 
GMAT Focus 2: 645 Q87 V79 DI79
GPA: 8.8
18 Dec 2025, 03:35
Kudos
Bookmarks
S1 : We need to know which one is minimum. That information is not available. (NS)
S2 : The minimum one is given, but the at least value is missing. (NS)
Together sufficient. (C)
S2 : The minimum one is given, but the at least value is missing. (NS)
Together sufficient. (C)
