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

Redeem
TTP OnDemand GMAT Video Course
Featured Course

Target Test Prep GMAT OnDemand

Scott Woodbury-Stewart’s private virtual classroom — 400 hours of master-class video lessons for the GMAT Focus Edition.

  • 715+ score guarantee — highest in the industry (99th percentile)
  • 52 chapters · 1,500+ lessons · 4,000+ practice questions
  • 400 hours of video · 1,500+ instructor-led HD smartboard lessons
  • 300,000+ students accepted to Harvard, Stanford, Wharton, Booth & Sloan & more
  • 24/7 live support + weekly Zoom office hours with GMAT instructors
  • TTP AI Assist — 24/7 AI-powered virtual tutor for instant help
  • 1,200+ flashcards + AI-powered study assistant & daily calendar
  • OnDemand, LiveTeach & GMAT Bootcamp formats available
  • Also: GRE, SAT Math & Executive Assessment courses
  • MBA Admissions Consulting now available
  • 🏆 2025 EdTech Breakthrough Award: Test Prep Solution Provider of the Year
  • 200,000+ students served
  • 5-day free trial — $0 to start, no auto-billing, cancel anytime
★★★★★ 5.0 (559 reviews)
130-pt guarantee
$0 to start then $127/mo
Start Free 5-Day Trial Read 559 Reviews →

arrangement

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
Junior | Next Rank: 30 Posts
Posts: 14
Joined: Thu Jun 26, 2008 3:58 am
by gupta.amit3 » Sun Nov 09, 2008 8:41 am
94. Find the numbers of ways in which 4 boys and 4 girls can be seated alternatively.

1) in a row and there is a boy named John and a girl named Susan amongst the group who cannot be put in adjacent seats

Pls help with explanation.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Source: — Problem Solving |
Junior | Next Rank: 30 Posts
Posts: 20
Joined: Sat Sep 13, 2008 11:30 am

by sgarnepudi » Sun Nov 09, 2008 9:15 am
is the ans is 14?
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 871
Joined: Wed Aug 13, 2008 7:48 am
Thanked: 48 times

by stop@800 » Sun Nov 09, 2008 10:28 am
Find the numbers of ways in which 4 boys and 4 girls can be seated alternatively.

Total ways
2 * 4! * 4!

first is boy
patterm
BGBGBGBG
so boys can arrange in 4! ways and girls in 4! ways

first can be girl also hence again 4! * 4! ways

total
2 * 4! * 4!




in a row and there is a boy named John and a girl named Susan amongst the group who cannot be put in adjacent seats

lets take the case whn J and S are together

JS BGBGBG
so 3 boys and 3 girls left
3! * 3! arrangements

JS can be SJ also hence
3! * 3! * 2

now JS has 4 similar positions
so
3! * 3! * 2 * 4

now cases whn they are not together
2 * 4! * 4! - 3! * 3! * 2 * 4
=16 * 6 * 6
=576


OA please
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 891
Joined: Sat Aug 16, 2008 4:21 amFollowed by: 1 member
Thanked: 27 times
GMAT Score:660(

by 4meonly » Mon Nov 10, 2008 10:08 am
I think it will be 2*7*3!*3! with answer 502
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 683
Joined: Tue Jul 22, 2008 1:58 pmFollowed by: 2 members
Location: Dubai
Thanked: 73 times

by mals24 » Mon Nov 10, 2008 10:50 am
@4meonly

Your reasoning is partially right. You haven't completed the solution.

In order to find out the number of ways John and Susan cannot sit together we can subtract the total number of arrangements possible and number of ways john and susan can sit together.

Total arrangements possible

BGBGBGBG

4*4*3*3*2*2*1*1 = 4!*4! = 576

You can also have GBGBGBGB = 4!*4! = 576

Hence total arrangements = 576 + 576 = 1152

Number of ways John and Susan can sit together

Let JS be one entity

Total arrangements JS BGBGBG = 1*3*3*2*2*1*1 = 3!*3! = 36

JS BGBGBG can be arranges in 7 ways = 36*7= 252

We can also have JS GBGBGB = 7*3!*3! = 252

Total arrangements = 252+252 = 504

2*7*3!*3! = 504 is the number of ways John and Susan can sit together.

We need to subtract this from the total number of alternative arrangements possible
Total number of arrangements possible in which John and Susan cannot sit together =1152 - 504 = 648.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 2134
Joined: Mon Oct 20, 2008 11:26 pmFollowed by: 25 members
Thanked: 237 times
GMAT Score:730

by logitech » Mon Nov 10, 2008 11:29 am
mals24 wrote:@4meonly

Your reasoning is partially right. You haven't completed the solution.

In order to find out the number of ways John and Susan cannot sit together we can subtract the total number of arrangements possible and number of ways john and susan can sit together.

Total arrangements possible

BGBGBGBG

4*4*3*3*2*2*1*1 = 4!*4! = 576

You can also have GBGBGBGB = 4!*4! = 576

Hence total arrangements = 576 + 576 = 1152

Number of ways John and Susan can sit together

Let JS be one entity

Total arrangements JS BGBGBG = 1*3*3*2*2*1*1 = 3!*3! = 36

JS BGBGBG can be arranges in 7 ways = 36*7= 252

We can also have JS GBGBGB = 7*3!*3! = 252

Total arrangements = 252+252 = 504

2*7*3!*3! = 504 is the number of ways John and Susan can sit together.

We need to subtract this from the total number of alternative arrangements possible
Total number of arrangements possible in which John and Susan cannot sit together =1152 - 504 = 648.
Mals,

Good work. What most of the people did not see in this problem was John and Susan can sit in 7 different positions, and since they can switch = 14 ways

JS XX XX XX
XJ SX XX XX
XX JS XX XX
XX XJ SX XX
XX XX JS XX
XX XX XJ SX
XX XX XX JS

so it comes down to:

2x4!x4! - 2x7x3!x3! = 648
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 2467
Joined: Thu Aug 28, 2008 6:14 pmFollowed by: 11 members
Thanked: 331 times

by cramya » Mon Nov 10, 2008 2:35 pm
Nice solution Mals!

Your reasoning is partially right. You haven't completed the solution.

In order to find out the number of ways John and Susan cannot sit together we can subtract the total number of arrangements possible and number of ways john and susan can sit together.

Total arrangements possible

BGBGBGBG

4*4*3*3*2*2*1*1 = 4!*4! = 576

You can also have GBGBGBGB = 4!*4! = 576

Hence total arrangements = 576 + 576 = 1152

Number of ways John and Susan can sit together

Let JS be one entity

Total arrangements JS BGBGBG = 1*3*3*2*2*1*1 = 3!*3! = 36

JS BGBGBG can be arranges in 7 ways = 36*7= 252

We can also have JS GBGBGB = 7*3!*3! = 252

Total arrangements = 252+252 = 504

2*7*3!*3! = 504 is the number of ways John and Susan can sit together.

We need to subtract this from the total number of alternative arrangements possible
Total number of arrangements possible in which John and Susan cannot sit together =1152 - 504 = 648.





LOGITECH HOPE THIS HELPS :-)
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 871
Joined: Wed Aug 13, 2008 7:48 am
Thanked: 48 times

by stop@800 » Mon Nov 10, 2008 8:07 pm
logitech wrote:
mals24 wrote:@4meonly

Your reasoning is partially right. You haven't completed the solution.

In order to find out the number of ways John and Susan cannot sit together we can subtract the total number of arrangements possible and number of ways john and susan can sit together.

Total arrangements possible

BGBGBGBG

4*4*3*3*2*2*1*1 = 4!*4! = 576

You can also have GBGBGBGB = 4!*4! = 576

Hence total arrangements = 576 + 576 = 1152

Number of ways John and Susan can sit together

Let JS be one entity

Total arrangements JS BGBGBG = 1*3*3*2*2*1*1 = 3!*3! = 36

JS BGBGBG can be arranges in 7 ways = 36*7= 252

We can also have JS GBGBGB = 7*3!*3! = 252

Total arrangements = 252+252 = 504

2*7*3!*3! = 504 is the number of ways John and Susan can sit together.

We need to subtract this from the total number of alternative arrangements possible
Total number of arrangements possible in which John and Susan cannot sit together =1152 - 504 = 648.
Mals,

Good work. What most of the people did not see in this problem was John and Susan can sit in 7 different positions, and since they can switch = 14 ways

JS XX XX XX
XJ SX XX XX
XX JS XX XX
XX XJ SX XX
XX XX JS XX
XX XX XJ SX
XX XX XX JS
But first condition ("4 boys and 4 girls can be seated alternatively") will get violated in some cases.

so it comes down to:

2x4!x4! - 2x7x3!x3! = 648
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 2134
Joined: Mon Oct 20, 2008 11:26 pmFollowed by: 25 members
Thanked: 237 times
GMAT Score:730

by logitech » Mon Nov 10, 2008 8:18 pm
stop@800 wrote:
logitech wrote:
mals24 wrote:@4meonly

Your reasoning is partially right. You haven't completed the solution.

In order to find out the number of ways John and Susan cannot sit together we can subtract the total number of arrangements possible and number of ways john and susan can sit together.

Total arrangements possible

BGBGBGBG

4*4*3*3*2*2*1*1 = 4!*4! = 576

You can also have GBGBGBGB = 4!*4! = 576

Hence total arrangements = 576 + 576 = 1152

Number of ways John and Susan can sit together

Let JS be one entity

Total arrangements JS BGBGBG = 1*3*3*2*2*1*1 = 3!*3! = 36

JS BGBGBG can be arranges in 7 ways = 36*7= 252

We can also have JS GBGBGB = 7*3!*3! = 252

Total arrangements = 252+252 = 504

2*7*3!*3! = 504 is the number of ways John and Susan can sit together.

We need to subtract this from the total number of alternative arrangements possible
Total number of arrangements possible in which John and Susan cannot sit together =1152 - 504 = 648.
Mals,

Good work. What most of the people did not see in this problem was John and Susan can sit in 7 different positions, and since they can switch = 14 ways

JS XX XX XX
XJ SX XX XX
XX JS XX XX
XX XJ SX XX
XX XX JS XX
XX XX XJ SX
XX XX XX JS
But first condition ("4 boys and 4 girls can be seated alternatively") will get violated in some cases.

so it comes down to:

2x4!x4! - 2x7x3!x3! = 648
That's good point. And what do you offer as a solution to your question ?
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 2467
Joined: Thu Aug 28, 2008 6:14 pmFollowed by: 11 members
Thanked: 331 times

by cramya » Mon Nov 10, 2008 8:20 pm
I am waiting for the business man solution /approach, Logitech and who better to provide than yourself :-)

Dont have any Bud?
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 2134
Joined: Mon Oct 20, 2008 11:26 pmFollowed by: 25 members
Thanked: 237 times
GMAT Score:730

by logitech » Mon Nov 10, 2008 8:23 pm
cramya wrote:I am waiting for the business man solution /approach, Logitech and who better to provide than yourself :-)

Dont have any Bud?
Ladies first
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 2467
Joined: Thu Aug 28, 2008 6:14 pmFollowed by: 11 members
Thanked: 331 times

by cramya » Mon Nov 10, 2008 8:24 pm
Go then. What r u waiting for? We will follow you....
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 2134
Joined: Mon Oct 20, 2008 11:26 pmFollowed by: 25 members
Thanked: 237 times
GMAT Score:730

by logitech » Mon Nov 10, 2008 8:33 pm
stop@800 wrote:


But first condition ("4 boys and 4 girls can be seated alternatively") will get violated in some cases.
Find the numbers of ways in which 4 boys and 4 girls can be seated alternatively.

Okay, I re-read the stem again. You have a great point there regarding the violation but actually the stem itself limits its scope. We are only dealing with alternative seatings. So we are good!
LGTCH
---------------------
"DON'T LET ANYONE STEAL YOUR DREAM!"
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply
• Page 1 of 1