Find the number of ways in which 5 men and 4 women can be : Quant Question Archive [LOCKED]
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 20 Jan 2017, 15:03

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

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Find the number of ways in which 5 men and 4 women can be

Author Message
Director
Joined: 10 Oct 2005
Posts: 528
Location: US
Followers: 1

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

Find the number of ways in which 5 men and 4 women can be [#permalink]

Show Tags

26 May 2006, 04:43
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Find the number of ways in which 5 men and 4 women can be seated round a table so that no two women are together.
Director
Joined: 05 Feb 2006
Posts: 898
Followers: 3

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

Show Tags

26 May 2006, 05:07
Total number of ways to sit 5 men in 4 women near the table=5C9+4C9=252

Number of ways to sit 2 women near each other=9 (this may be a mistake )

Total number of ways to sit so that no 2 women sit near each other=252-9=243
Director
Joined: 13 Nov 2003
Posts: 790
Location: BULGARIA
Followers: 1

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

Show Tags

26 May 2006, 06:11
IMO
it should be MMWMWMWMW=4!x3!
MWMWMWMWM=4!x3!
WMWMWMWMM=4!x3!
total-144x3=432
Director
Joined: 10 Oct 2005
Posts: 528
Location: US
Followers: 1

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

Show Tags

26 May 2006, 11:02
There is no OE. But the following may help you solve such problems ---

The number of ways of arranging n persons along a round table so that no person has the same two neighbours is(n-1)!/2
Director
Joined: 10 Oct 2005
Posts: 528
Location: US
Followers: 1

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

Show Tags

26 May 2006, 11:03
Senior Manager
Joined: 09 Aug 2005
Posts: 285
Followers: 1

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

Show Tags

27 May 2006, 09:02
mahesh004 wrote:
There is no OE. But the following may help you solve such problems ---

The number of ways of arranging n persons along a round table so that no person has the same two neighbours is(n-1)!/2

That is the formula when we treat anti-clockwise and clockwise arrangements identical.

Should it not be

five men in (5-1)!

4 w in 5 spots 5P4
4! x 5!

Director
Joined: 10 Oct 2005
Posts: 528
Location: US
Followers: 1

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

Show Tags

27 May 2006, 11:25
Manager
Joined: 13 Apr 2006
Posts: 56
Followers: 0

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

Show Tags

27 May 2006, 11:49
Yes, the formula for the arrangement in a circle is (x-1)!, so it is 4!x5!
27 May 2006, 11:49
Display posts from previous: Sort by