Find all School-related info fast with the new School-Specific MBA Forum

It is currently 18 May 2013, 18:52
Customize  |  Hide

Xander, Yolanda, and Zelda each have at least one hat. Zelda

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
1 KUDOS received
Intern
Intern
Joined: 23 Aug 2011
Posts: 47
Followers: 0

Kudos [?]: 2 [1] , given: 4

Xander, Yolanda, and Zelda each have at least one hat. Zelda [#permalink] New post 07 Oct 2011, 22:23
1
This post received
KUDOS
00:00

Question Stats:

61% (01:53) correct 38% (02:21) wrong based on 0 sessions
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.
[Reveal] Spoiler: OA
1 KUDOS received
Math Forum Moderator
Joined: 20 Dec 2010
Posts: 2100
Followers: 108

Kudos [?]: 654 [1] , given: 376

GMAT Tests User
Re: DS [#permalink] New post 08 Oct 2011, 00:35
1
This post received
KUDOS
kkalyan wrote:
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.


kkalyan: Please tag the source correctly. It is a Manhattan GMAT question, not a GMAT Prep question. Also, please try to give a unique name for the subject.

MGMAT DS: Hats owned by Xander, Yolanda, and Zelda

Z>Y>X
Z+Y+X=12

1) Z-X<=5
1, 5, 6
2, 4, 6
Not Sufficient.

2) X.Y.Z<36
1, 5, 6
1, 2, 9
Not Sufficient.

Combined;
{1, 5, 6}
Y=5

Ans: "C"
_________________

~fluke

Find out what's new at GMAT Club - latest features and updates

Intern
Intern
Joined: 14 Oct 2011
Posts: 1
Followers: 0

Kudos [?]: 0 [0], given: 19

Re: DS [#permalink] New post 22 Apr 2012, 19:27
Hi fluke,

what about the combination {1,4,7}. even this satisfies the 2 conditions right.
1+4+7=12(x<y<z) and
1*4*7=28 which is < 36


So, I think answer should be E. Can you please help.
GMAT Club team member
User avatar
Joined: 02 Sep 2009
Posts: 11506
Followers: 1791

Kudos [?]: 9526 [0], given: 826

Re: DS [#permalink] New post 22 Apr 2012, 21:44
anushapolavarapu wrote:
Hi fluke,

what about the combination {1,4,7}. even this satisfies the 2 conditions right.
1+4+7=12(x<y<z) and
1*4*7=28 which is < 36


So, I think answer should be E. Can you please help.


Welcome to GMAT Club. Below is an answer to your doubt.

The case when x=1, y=4, and z=7 does not satisfy the first statement, which says that z-x\leq{5} (Zelda has no more than 5 hats more than Xander). Also notice that there are some cases missing for (1) and (2) in fluke's solution.

Complete solution:

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?

Given: x<y<z and x+y+z=12. Question: y=?

Now, only following 7 cases are possible;

X-Y-Z
1-2-9
1-3-8
1-4-7
1-5-6
2-3-7
2-4-6
3-4-5

(1) Zelda has no more than 5 hats more than Xander --> z-x\leq{5} --> first 3 cases are out and only following cases are left: {1, 5, 6}, {2, 3, 7}, {2, 4, 6}, and {3, 4, 5}. Not sufficient.

(2) The product of the numbers of hats that Xander, Yolanda, and Zelda have is less than 36 --> last 3 cases are out and only following cases are left: {1, 2, 9}, {1, 3, 8}, {1, 4, 7}, and {1, 5, 6}. Not sufficient.

(1)+(2) There is only one case common for (1) and (2): {1, 5, 6}, so z=6. Sufficient.

Answer: C.

Hope it's clear.
_________________

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!


What are GMAT Club Tests?
25 extra-hard Quant Tests

Find out what's new at GMAT Club - latest features and updates

Manager
Manager
Joined: 01 Apr 2010
Posts: 205
Followers: 1

Kudos [?]: 11 [0], given: 4

GMAT Tests User
Re: DS [#permalink] New post 23 Apr 2012, 10:17
anushapolavarapu wrote:
Hi fluke,

what about the combination {1,4,7}. even this satisfies the 2 conditions right.
1+4+7=12(x<y<z) and
1*4*7=28 which is < 36


So, I think answer should be E. Can you please help.


{1,4,7}. Z has more than 5 hats than X does. Again great explanation above.

Do you suggest during these type of questions to spend time writing out all combination possibilities at the start?
GMAT Club team member
User avatar
Joined: 02 Sep 2009
Posts: 11506
Followers: 1791

Kudos [?]: 9526 [0], given: 826

Xander, Yolanda, and Zelda each have at least one hat. Zelda [#permalink] New post 23 Apr 2012, 10:37
aalba005 wrote:
anushapolavarapu wrote:
Hi fluke,

what about the combination {1,4,7}. even this satisfies the 2 conditions right.
1+4+7=12(x<y<z) and
1*4*7=28 which is < 36


So, I think answer should be E. Can you please help.


{1,4,7}. Z has more than 5 hats than X does. Again great explanation above.

Do you suggest during these type of questions to spend time writing out all combination possibilities at the start?


It depends how many possible combinations are there. Luckily there are only 7 for this question, so it's not hard to write them all down. In this case everything will be in front of you so you won't miss any case while solving.
_________________

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. NEW!!!

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set. NEW!!!


What are GMAT Club Tests?
25 extra-hard Quant Tests

Find out what's new at GMAT Club - latest features and updates

Xander, Yolanda, and Zelda each have at least one hat. Zelda   [#permalink] 23 Apr 2012, 10:37
    Similar topics Author Replies Last post
Similar
Topics:
New posts Zelda: Dr. Ladlow, a research psychologist, has convincingly anandnk 6 29 Dec 2003, 09:59
Popular new posts Zelda: Dr. Ladlow, a research psychologist, has convincingly aspire 10 12 Apr 2004, 13:27
New posts Zelda: Dr. Ladlow, a research psychologist, has convincingly chunjuwu 9 09 Sep 2004, 07:53
New posts Zelda: Dr. Ladlow, a research psychologist, has convincingly rahulraao 3 13 Oct 2005, 18:31
New posts EXPERTS_POSTS_IN_THIS_TOPIC Xavier, Yvonne, and Zelda each try independently to solve a redbeanaddict 4 20 Jun 2008, 00:58
Display posts from previous: Sort by

Xander, Yolanda, and Zelda each have at least one hat. Zelda

  Question banks Downloads My Bookmarks Reviews  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.