BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

side of every woman

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
GMAT Instructor
Posts: 3650
Joined: Wed Jan 21, 2009 4:27 am
Location: India
Thanked: 267 times
Followed by:80 members
GMAT Score:760

side of every woman

by sanju09 » Sat Feb 27, 2010 1:16 am
Seven women and seven men are to sit around a circular table such that there is a man on either side of every woman. What is the total number of seating arrangements?
(A) (7!)^2
(B) 6! X 7!
(C) (6!)^2
(D) 7!
(E) 6!
The mind is everything. What you think you become. -Lord Buddha



Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001

www.manyagroup.com
Top
Source: — Problem Solving |
User avatar
Master | Next Rank: 500 Posts
Posts: 102
Joined: Sat Feb 20, 2010 5:38 am
Location: IIM Ahmedabad
Thanked: 10 times

by firdaus117 » Sat Feb 27, 2010 8:18 am
The women can be seated around a circular table in (7-1)!=6! ways
Now,there are seven vacant places in between all women where seven men can be seated in 7! ways.
[spoiler]Hence total no. of ways=6!7!
Option B[/spoiler]
Top
Senior | Next Rank: 100 Posts
Posts: 60
Joined: Wed Jan 07, 2009 1:56 pm
Thanked: 12 times
GMAT Score:750

by arzanr » Sat Feb 27, 2010 9:25 am
firdaus117 wrote:The women can be seated around a circular table in (7-1)!=6! ways
Now,there are seven vacant places in between all women where seven men can be seated in 7! ways.
[spoiler]Hence total no. of ways=6!7!
Option B[/spoiler]
Hmm.. why would the women be seated around in 6! and not 7! ways? Shouldnt there be 7 options for the first woman, 6 for the next and so on?
Top
User avatar
Master | Next Rank: 500 Posts
Posts: 102
Joined: Sat Feb 20, 2010 5:38 am
Location: IIM Ahmedabad
Thanked: 10 times

by firdaus117 » Sat Feb 27, 2010 9:35 am
arzanr wrote:
firdaus117 wrote:The women can be seated around a circular table in (7-1)!=6! ways
Now,there are seven vacant places in between all women where seven men can be seated in 7! ways.
[spoiler]Hence total no. of ways=6!7!
Option B[/spoiler]
Hmm.. why would the women be seated around in 6! and not 7! ways? Shouldnt there be 7 options for the first woman, 6 for the next and so on?
Circular arrangements(like pearls in a neclace or people around a circular table) are different than the straight line arrangements(arrangement of words or people in a row) in a way that in a circle there is no concept of a reference point or no concept of left-right.So we need a reference point around which we can arrange the things around.This is done by using one person as a reference.For example,we first sit a woman in the table then we build the arrangement by sitting other women aroung this particular lady.Hence since this lady is "fixed" as reference,other six can be moved around in 6! ways.
Hope I am clear. :)
Top
User avatar
Master | Next Rank: 500 Posts
Posts: 102
Joined: Sat Feb 20, 2010 5:38 am
Location: IIM Ahmedabad
Thanked: 10 times

by firdaus117 » Sat Feb 27, 2010 9:49 am
A better explanation than above one:
Let's consider that 4 persons A,B,C, and D are sitting around a round table

Shifting A, B, C, D, one position in anticlock-wise direction, we get the following agreements:-

Image


Thus, we use that if 4 persons are sitting at a round table, then they can be shifted four times, but these four arrangements will be the same, because the sequence of A, B, C, D, is same. But if A, B, C, D, are sitting in a row, and they are shifted, then the four linear-arrangement will be different.


Hence if we have '4' things, then for each circular-arrangement number of linear-arrangements =4

Similarly, if we have 'n' things, then for each circular - agreement, number of linear - arrangement = n.

Let the total circular arrangement = p

Total number of linear-arrangements = n.p

Total number of linear-arrangements

= n. (number of circular-arrangements)

Or Number of circular-arrangements = 1 (number of linear arrangements)

n = 1( n!)/n

circular permutation = (n-1)!
Top
Post new topic Post Reply
• Page 1 of 1