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 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 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.
16 Sep 2014, 01:52
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:
57% (02:38) correct
43%
(02:39)
wrong
based on 58
sessions
History
Date
Time
Result
Not Attempted Yet
Xander, Yolanda, and Zelda each have at least one hat. Zelda has more hats than Yolanda, who has more than Xander. Together, the total number of hats the three people have is 12. How many hats does Yolanda have?
(1) Zelda has no more than 5 hats more than Xander.
(2) The product of the numbers of hats that Xander, Yolanda, and Zelda have is less than 36.
(1) Zelda has no more than 5 hats more than Xander.
(2) The product of the numbers of hats that Xander, Yolanda, and Zelda have is less than 36.
16 Sep 2014, 01:52
Kudos
Bookmarks
Official Solution:
Write \(x\) for the number of hats Xander has, \(y\) for the number of hats Yolanda has, and \(z\) for the number of hats Zelda has. From the question stem, we know that \(x \lt y \lt z\) and that \(x + y + z = 12\). Moreover, since each person has at least one hat, and people can only have integer numbers of hats, we know that \(x\), \(y\), and \(z\) are all positive integers. With this number of constraints, we should go ahead and list scenarios that fit all the constraints. Start with \(x\) and \(y\) as low as possible, then adjust from there, keeping the order, keeping the sum at 12, and ensuring that no two integers are the same.
Scenario \(x\) \(y\) \(z\) (a) 1 2 9 (b) 1 3 8 (c) 1 4 7 (d) 1 5 6 (e) 2 3 7 (f) 2 4 6 (g) 3 4 5
These are the only seven scenarios that work. As a reminder, we are looking for the value of \(y\). Now, we turn to the statements.
Statement (1): INSUFFICIENT. We are told that \(z - x\) is less than or equal to 5. This rules out scenarios (a) through (c), but the last four scenarios still work. Thus, \(y\) could be 3, 4, or 5.
Statement (2): INSUFFICIENT. We are told that \(xyz\) is less than 36. We work out this product for the seven scenarios:
(a) 18
(b) 24
(c) 28
(d) 30
(e) 42
(f) 48
(g) 60
We can rule out scenarios (e) through (g), but (a) through (d) still work. Thus, \(y\) could be 2, 3, 4, or 5.
Statements (1) and (2) together: SUFFICIENT. Only scenario (d) survives the constraints of the two statements. Thus, we know that \(y\) is 5.
Answer: C
Write \(x\) for the number of hats Xander has, \(y\) for the number of hats Yolanda has, and \(z\) for the number of hats Zelda has. From the question stem, we know that \(x \lt y \lt z\) and that \(x + y + z = 12\). Moreover, since each person has at least one hat, and people can only have integer numbers of hats, we know that \(x\), \(y\), and \(z\) are all positive integers. With this number of constraints, we should go ahead and list scenarios that fit all the constraints. Start with \(x\) and \(y\) as low as possible, then adjust from there, keeping the order, keeping the sum at 12, and ensuring that no two integers are the same.
Scenario \(x\) \(y\) \(z\) (a) 1 2 9 (b) 1 3 8 (c) 1 4 7 (d) 1 5 6 (e) 2 3 7 (f) 2 4 6 (g) 3 4 5
These are the only seven scenarios that work. As a reminder, we are looking for the value of \(y\). Now, we turn to the statements.
Statement (1): INSUFFICIENT. We are told that \(z - x\) is less than or equal to 5. This rules out scenarios (a) through (c), but the last four scenarios still work. Thus, \(y\) could be 3, 4, or 5.
Statement (2): INSUFFICIENT. We are told that \(xyz\) is less than 36. We work out this product for the seven scenarios:
(a) 18
(b) 24
(c) 28
(d) 30
(e) 42
(f) 48
(g) 60
We can rule out scenarios (e) through (g), but (a) through (d) still work. Thus, \(y\) could be 2, 3, 4, or 5.
Statements (1) and (2) together: SUFFICIENT. Only scenario (d) survives the constraints of the two statements. Thus, we know that \(y\) is 5.
Answer: C
