Last visit was: 25 Apr 2026, 22:31 It is currently 25 Apr 2026, 22:31
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.
Close
Request Expert Reply
Confirm Cancel
User avatar
mahesh004
Joined: 10 Oct 2005
Last visit: 13 Mar 2007
Posts: 271
Own Kudos:
Location: US
Posts: 271
Kudos: 609
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
SimaQ
Joined: 06 Feb 2006
Last visit: 24 May 2007
Posts: 430
Own Kudos:
Posts: 430
Kudos: 649
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
BG
Joined: 13 Nov 2003
Last visit: 29 Sep 2020
Posts: 352
Own Kudos:
Location: BULGARIA
Concentration: INSURANCE, RISK MANAGEMENT
Posts: 352
Kudos: 215
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
mahesh004
Joined: 10 Oct 2005
Last visit: 13 Mar 2007
Posts: 271
Own Kudos:
Location: US
Posts: 271
Kudos: 609
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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
User avatar
mahesh004
Joined: 10 Oct 2005
Last visit: 13 Mar 2007
Posts: 271
Own Kudos:
Location: US
Posts: 271
Kudos: 609
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
old_dream_1976
Joined: 09 Aug 2005
Last visit: 30 Nov 2006
Posts: 133
Own Kudos:
Posts: 133
Kudos: 17
Kudos
Add Kudos
Bookmarks
Bookmark this Post
mahesh004
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!

:?
User avatar
mahesh004
Joined: 10 Oct 2005
Last visit: 13 Mar 2007
Posts: 271
Own Kudos:
Location: US
Posts: 271
Kudos: 609
Kudos
Add Kudos
Bookmarks
Bookmark this Post
but your answer is same
User avatar
kuristar
Joined: 13 Apr 2006
Last visit: 19 Jun 2006
Posts: 37
Own Kudos:
Posts: 37
Kudos: 81
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Yes, the formula for the arrangement in a circle is (x-1)!, so it is 4!x5!



Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Where to now? Join ongoing discussions on thousands of quality questions in our Quantitative Questions Forum
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.
Thank you for understanding, and happy exploring!