![]() |
| In a village of 100 households - PS Problem |
| Re: In a village of 100 households - PS Problem |
|
Guest
|
This was a really tough one. I drew three circles and put the respective numbers into each ciricle. To find the max: I just took the smallest number (55) and put it in the middle of the Venn diagram. This worked out well: 80 - 55 = 25 75 - 55 = 20 55 - 55 = 0 When we add up all the numbers in the diagram, they're supposed to give us 100 25 + 20 + 0 + 55 = 100 To find the minimum, I thought about the sum of all the numbers (210) and they best way to distribute them to all 6 shared sections without putting something in the middle. Average! 210/6 = 180 and you have 30 leftover. Since you have 30 leftover, you can just put 10 in the middle and each of the sections will get 10 which = 30. |
||||||||||||||
|
|
|||||||||||||||
|
esseisle
Guest
|
thank you ,but the answer is 45 ?
|
||||||||||||
|
|
|||||||||||||
| Re: In a village of 100 households - PS Problem |
|
parvezshah
Guest
|
The question says about minimum number not maximum amount so let say all the villagers has all the devices . X= 100 for the minimum say "55 have at least one MP3 player" so lets say that 55 of them had all 3 of them as this assertion also keeps the question true only 100 - 55 = 45 |
||||||||||||||
|
|
|||||||||||||||
|
Guest
|
This is a toughie - perhaps Stacey or her collegues could weigh in here, it would be helpful.
Here's how I approached this - consider the two limited cases. 1) As much of the "overlap" as possible occurs in three device households and 2) As much of the overlap as possible occurs in exactly two device households, minimizing the number of two device households. 1) This is the easy case - just assume all the overlap occurs in three device households. Let X = number of homes with all three devices. We know that 75-80-55-2X=100. so X=55. You have to use 2x in the equation above because the region where all three overlap is triply counted. So in this case, 20 households have only a DVD player, 25 have only a cell phone, 0 have only a MP3 player and 55 households have all three. 2) Here it's tempting to guess that it's possible to have all the overlap occur in households that have exactly two of the devices, therefore X-Y = 55. Alas, there is no way to distribute the exactly two device households in a way that works without having any 3-device households. After drawing the diagram and interating, you can see that you need at least 10 3-device households, so X-Y= 55-10 = 45. It's important to be careful to keep track if you are dealing with "at least" or "exactly" two device households. If someone has a more intuitive appoach to this case, I'd love to hear it. cheers |
||||||||||||
|
|
|||||||||||||
|
Guest
|
In my post above, I meant to say in the second case "minimize the number of 3-device households"...
|
||||||||||||
|
|
|||||||||||||
|
calgmatter
Guest
|
In Fig above, Step 1: Assign DVD homes from right = 75 homes Step 2: Assign Cell homes from left = 80 homes Step 3: We now know 55 homes have D+C (typo in fig) We have 55 MP3s that we can distribute all to D+C (which gives us max as 55) or distribute 25 to portion IV and 20 to portion V and the rest 10 to portion III and so the minimum would be portion III which is 10 homes. Answer 45. |
||||||||||||
|
|
|||||||||||||
| guest |
|
guest
Guest
|
Great way to diagram the problem, thanks!
|
||||||||||||
|
|
|||||||||||||
| In a village of 100 households - PS Problem |
|
Guest
|
Ron,
Any simple method on how to get the minimum number.. Below is waht I did 100 = 75+80+55- both+all (all have atleast one, so none is 0) 100=210-both+all 110=both-all Now if I want to minimize "all" then, I have to maximize both, how do I do that ? Regards... |
||||||||||||
|
|
|||||||||||||
|
Rey Fernandez
MGMAT STAFF
|
Is this question truly a GMAT Prep question? esseisle, can you confirm the source of this question?
Great method, calgmatter. That's how I went about it, too. |
||||||||||||
|
|
|||||||||||||
|
Dan
Guest
|
That is a tough one! Hopefully more difficult than something I'll see on a test.
This is the approach I found easiest for me to understand. First we need to figure out what the maximum is. We know it is possible there are 55 with all three, since the 55 MP3 owners is smallest set of the three. (Max = # of MP3) To calculate the fewest possible, we first need to figure out how many must have all three devices. (max possible - max without all three = minimum with all three). Of the 80 cell phone owners, 25 cannot have an MP3 player 80 - 55 = 25. Similarly, 20 of the DVD owners cannot have an MP3 player. 75 - 55 = 20. If the owners who do not have all three are unique (no overlap), we get the maximum number of owners who do not own an MP3 player, and thus cannot own all three devices. Max possible - maximum without all three = minimum number of people with all three devices. 55 - 45 = 10 Now we can solve: 55 - 10 = 45. |
||||||||||||
|
|
|||||||||||||
| In a village of 100 households - PS Problem |
|
||
|
Powered by phpBB © phpBB Group
Content © Manhattan GMAT Forums
*GMAT and GMAT CAT are registered trademarks of the Graduate Management Admission Council,
which neither sponsors nor endorses this test preparation service.
Content © Manhattan GMAT Forums
*GMAT and GMAT CAT are registered trademarks of the Graduate Management Admission Council,
which neither sponsors nor endorses this test preparation service.



