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

It is currently 10 Jul 2014, 19:46

Close

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

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Combinations problem

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Intern
Intern
avatar
Joined: 27 Dec 2004
Posts: 6
Followers: 0

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

Combinations problem [#permalink] New post 17 Mar 2005, 12:08
Can anyone help me with this problem?

A woman has 11 close friends. Find the number of ways she can invite 5 of them to dinner if

a.) 2 of the friends are married and will not attend seperately?

Ans: 210


b.) 2 of the friends are not on speaking terms and will not attend together?

Ans: 252

Thanks for the assistance
Senior Manager
Senior Manager
avatar
Joined: 15 Mar 2005
Posts: 425
Location: Phoenix
Followers: 1

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

GMAT Tests User
 [#permalink] New post 17 Mar 2005, 13:46
Lets take them one by one.

[I am assuming that 2 people (say A and B) are married and both are a part of the 11]

a) The answer is

Case when the couple (group of two) attends + the case when the couple doesn't attend

When the couple attends, you need to choose 3 out of remaining 9. C(9,3)
When they don't, you need to choose 5 out of remaining 9. C(9, 5).

The answer therefore = C(9, 3) + C(9,5) = 84 + 126 = 210.

b) The total ways of inviting = C(11, 5) = 462.

The ways in which these 2 wud not be invited together = total ways of invitation - ways in which they would be invited together.

Now the ways in which they're invited together:
Assume they make 1 group. So ways in which they're invited together = C (9, 3) + C(9, 5) // when they're invited + when they're not invited
= 210.

Therefore, the ways in which they would not be invited together
= 462 - 210 = 252.

Note that the two being invited together is the same as the "invited together" case of the couple in (a).

Hope this helps.
_________________

Who says elephants can't dance?

Manager
Manager
avatar
Joined: 01 Feb 2005
Posts: 63
Location: NYC
Followers: 1

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

 [#permalink] New post 17 Mar 2005, 14:51
nice explanations, kapslock
Intern
Intern
avatar
Joined: 27 Dec 2004
Posts: 6
Followers: 0

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

 [#permalink] New post 18 Mar 2005, 07:27
Thanks for your assistance. This site is great!!!!! :P :-D :lol:
  [#permalink] 18 Mar 2005, 07:27
    Similar topics Author Replies Last post
Similar
Topics:
combinations problem scorpio7 1 13 Jun 2009, 14:11
Combination problem positive_energy 6 18 Jul 2006, 06:28
Combinations problem Johnnyman 4 07 Feb 2005, 20:15
combination problem caribcon 2 29 Sep 2004, 09:37
combination problem caribcon 1 29 Sep 2004, 07:59
Display posts from previous: Sort by

Combinations problem

  Question banks Downloads My Bookmarks Reviews Important topics  


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®.