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

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

100% (06:04) correct
0% (00:00) wrong based on 3 sessions

HideShow timer Statistics

I do not know how to solve this problem so I need help. Thanks in advance!

On a business trip, 30 percent of 60 sales representatives will be given accommodations at Hotel XYZ and the remaining 70 percent will be given accommodations at Hotel ABC. However, 55 percent of the sales representatives prefer to stay at Hotel XYZ and 45 percent prefer to stay at Hotel ABC. What is the highest possible number of sales representatives NOT given accommodations at the hotel they prefer?

Re: PS: sets with sales representatives [#permalink]

Show Tags

03 Aug 2009, 05:07

This is the way i solved it.

Taking it up from the previous poster

Allocation given : XYZ = 18. ABC = 42. Preference wanted : XYZ = 33. ABC = 27. So we force all the people who wanted XYZ into taking ABC ---> 42 Left space in ABC --- 42-33 = 9 Disappointed XYZ people ---- 33 (all)

Then we force all the people in ABC into taking XYZ ----> 18 (capped out) Left space in XYZ --- NIL Disappointed ABC people --- 18 So now we can give the rest 9 to what they want.

So total disappointed people = 33+18 = 51 Ans E

what is OA _________________

If you have made mistakes, there is always another chance for you. You may have a fresh start any moment you choose, for this thing we call "failure" is not the falling down, but the staying down.

Re: PS: sets with sales representatives [#permalink]

Show Tags

04 Aug 2009, 12:57

Not getting their perference...

70% can stay in ABC while 45 % wants to stay here 30% gets to stay in XYZ while 55% wants to stay

so whats the least amount of people that can get satisfied? move all 55% who wants to stay in XYZ to ABC, while 30% in XYZ are all who wanted to go to ABCs, so we have 15% left that gets their preference to go to ABC, in the end, 85% of 60 people (51 people) doesn't get their preference.

Re: PS: sets with sales representatives [#permalink]

Show Tags

07 Aug 2009, 03:18

ANS is 51

Quote:

one suggestion plz solve this question in percentages only dont convert 30% of 60 or 45% of 60....it will not add any value rather eat lot of time for no reason.......

consider a case when all 30% of ppl staying in hotel XYZ are unhappy.... this gives us 30% from 45% are staying in XYZ..leaving 15% happy ppl in ABC but that also means 70%-15% = 55% are unhappy in hotal ABC

This means 30% of XYZ + 55% of ABc are unhappy ppl = 85% of 60 = 51 _________________

Bhushan S. If you like my post....Consider it for Kudos

Re: PS: sets with sales representatives [#permalink]

Show Tags

08 Aug 2009, 00:59

netcaesar wrote:

I do not know how to solve this problem so I need help. Thanks in advance!

On a business trip, 30 percent of 60 sales representatives will be given accommodations at Hotel XYZ and the remaining 70 percent will be given accommodations at Hotel ABC. However, 55 percent of the sales representatives prefer to stay at Hotel XYZ and 45 percent prefer to stay at Hotel ABC. What is the highest possible number of sales representatives NOT given accommodations at the hotel they prefer?

A) 11 B) 18 C) 36 D) 45 E) 51

xyz = 18, abc = 42

preference: xyz = 33, abc = 27 ( start by allocating the vice versa - abc preference into the xyz hotel)

42 places in abc hotel fill them with xyz preferecne 33 ( unsatisfied customers), we would be left with extra 9 places in abc hotel that we would fill from the abc preference of 27 and we would have 18 to move to the xyz hotel( another patch of unsatisfied customers)

Re: PS: sets with sales representatives [#permalink]

Show Tags

09 Aug 2009, 01:18

55% liked to stay at XYZ and remaining 45% at ABC. 1)Worst case condition when all 55% liked to stay at xyz are force to stay in ABC and the capacity left out in ABC is (70-55)%=15% 2)Now out of 45% liked to stay in ABC max only 15% can stay, so the remainig 30% has to stay in XYZ totally 55%+30% sales representatives NOT given accommodations at the hotel they prefer, which is 85% of 60 = 51

On a business trip, 30 percent of 60 sales representatives will be given accommodations at Hotel XYZ and the remaining 70 percent will be given accommodations at Hotel ABC. However, 55 percent of the sales representatives prefer to stay at Hotel XYZ and 45 percent prefer to stay at Hotel ABC. What is the highest possible number of sales representatives NOT given accommodations at the hotel they prefer?

This type of question is more an IQ test than maths. It's very easy to mis-read the question when under time constraints. But if you are careful, it is actually a very easy Q.

Anyway, here's the solution and discussion regarding the same question posted elsewhere in the forum:

Schools: Marshall (In with $$), Babson (In with $$), Simon (In with $ - Declined), Kellogg (Ding), Ross (Ding), Fuqua (Ding), Darden (Ding), Tepper (Ding)