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.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
Nov 2001:30 PM EST
-02:30 PM IST
Learn how Kamakshi achieved a GMAT 675 with an impressive 96th %ile in Data Insights. Discover the unique methods and exam strategies that helped her excel in DI along with other sections for a balanced and high score.
Nov 1912:30 PM EST
-01:30 PM EST
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
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2407:00 PM PST
-08:00 PM PST
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Nov 2510:00 AM EST
-11:00 AM EST
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.
25 Oct 2016, 16:13
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
55%
(hard)
Question Stats:
62% (01:54) correct
38%
(01:38)
wrong
based on 172
sessions
History
Date
Time
Result
Not Attempted Yet
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.
(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.
amandeep_k
GMAT 2: 710 Q50 V35
Posts: 31
26 Nov 2016, 04:25
Kudos
Bookmarks
duahsolo
Let x be the number of candies with child who received least candies, y who received 2nd highest and z be the highest so from question x<y<Z
(1) y+z =13 no information of x so z can be 11, y can be 2 and x can be 1 or z can be 10 y can be 3 and x can be 1 or 2, SO not Sufficient
(2) x+y=11 again x can be 1 and y 10 or x can be 2 and y 9 so not sufficient
Subtracting 2 from 1 (z-x=2) so x,y,z are consecutive integers so only one possible solution x=5,y=6,z=7
25 Sep 2017, 10:08
Kudos
Bookmarks
Bunuel
Let the three children be \(A\), \(B\) & \(C\) where candy distribution is \(A>B>C\). we need to find \(C\) the lowest
Statement 1: implies that \(A+B = 13\). or \(A=13-B\).
Hence \((A,B)\) can be: (12,1), (11,2), (10,3), (9,4), (8,5), (7,6). No information given about the lowest distribution Hence Insufficient,
Statement 2: implies that \(B+C=11\). or \(C=11-B\)
Hence \((B,C)\) can be: (10,1), (9,2), (8,3), (7,4), (6,5). There are multiple values of C possible. Hence Insufficient
Combining 1 & 2, we know that \(A>B>C\) and \(A+B=13\) and \(B+C=11\), from the given pair of possible values for \((A,B)\) and \((B,C)\), only one value satisfies the given conditions simultaneously
\(A=7\), \(B=6\) and \(C=5\). Hence Sufficient
Option C
