It is currently 21 Feb 2018, 12:38

Live Now:

How Cutting Corners KILLS Your GMAT - Live on YouTube

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

Tom, Jerry, and Donald and other three people sit in a line.

 post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
Current Student
Joined: 11 May 2008
Posts: 553
Tom, Jerry, and Donald and other three people sit in a line. [#permalink]

Show Tags

30 Jul 2008, 00:34
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Tom, Jerry, and Donald and other three people sit in a line. From left to right, if Tom cannot sit on the first seat, Jerry cannot sit on the second seat, and Donald cannot sit on the fourth seat, hoe many different arrangements are possible?
(A) 720
(B) 426
(C) 432
(D) 438
(E) 444
Intern
Joined: 22 Apr 2008
Posts: 36
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 01:15
1
KUDOS
according to me answer is C - 432

here is my explanantion...

lets num the seats from 1 - 6

so we have seats 1 2 3 4 5 6

now without any constraint total possible combinations are

6! -- (a)

now lets start with 1st contraint -

lets say Tom (T) is on 1

then remaining seats can be occupied in 5! ways (b)

now lets take 2nd constraint

lets say Jerry (J) is on 2

( Note possible combination is less than 5! as while assuming that T is on 1 we have already taken the case where J was on 2 so we have to consider only remaining cases i.e when T is not on 1 )

so total combinations possible are - 4 ( excluding T on 1) x 1 x 4 x 3 x 2 x 1= 4*4! ... (c)

now lets take 3rd constraint

lets say Donald (D) is on 4

( Note possible combination is less than (c) as while assuming that T is on 1 and J on 2 we have already taken the case where D was on 4 so we have to consider only remaining cases i.e when T is not on 1 and J is not on 2 )

so total combinations possible are - 4 (excluding T on 1) x 3 ( excluding J on 2 ) x 3 x1 x 2 x 1 = 12 * 3! .. (d)

final required soln is a - b-c-d

which we get as 432

please let me know if it is correct and also if there is better way of solving the prob

Nice question

Thanks
Current Student
Joined: 11 May 2008
Posts: 553
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 01:26
GOOD LOGIC.. I DONT HAVE THE OA. BUT I WAS DOING THE SAME WAY, EXCEPT THAT I USED TO REPEAT 5! EVERY TIME . I HAD FORGOTTEN. PROB UR ANS IS OK.

HAVE GIVEN U KUDOS
Director
Joined: 27 May 2008
Posts: 540
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 01:49
1
KUDOS
lets see ...

total number of ways = 720

number of ways when T:1 = 5! = 120
number of ways when J:2 = 5! = 120
number of ways when D:4 = 5! = 120

number of ways when T:1 and J:2 = 4! = 24
number of ways when J:2 and D:4 = 4! = 24
number of ways when D:4 and T:1 = 4! = 24

number of ways when t:1 and J:2 and D:4 = 3! = 6

we have to find when T:1 OR J:2 OR D:4 ....remember set theory
TUJUD = T + J + D - TiJ - JiD - DiT + TiJiD
= 120+120+120 - 24-24-24 + 6
= 294

so total number of ways when even one of these are not at the said positions = 720-294 = 426 ... option B
Intern
Joined: 22 Apr 2008
Posts: 36
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 02:03
Hi durgesh79

Thanks for ur quicker and easier approach... i m confused can u point out where I am wrong...

thanks a lot
Manager
Joined: 27 May 2008
Posts: 139
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 02:10
Good Explanation Durgesh +1
Current Student
Joined: 11 May 2008
Posts: 553
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 04:12
durgesh79 wrote:
lets see ...

total number of ways = 720

number of ways when T:1 = 5! = 120
number of ways when J:2 = 5! = 120
number of ways when D:4 = 5! = 120

number of ways when T:1 and J:2 = 4! = 24
number of ways when J:2 and D:4 = 4! = 24
number of ways when D:4 and T:1 = 4! = 24

number of ways when t:1 and J:2 and D:4 = 3! = 6

we have to find when T:1 OR J:2 OR D:4 ....remember set theory
TUJUD = T + J + D - TiJ - JiD - DiT + TiJiD
= 120+120+120 - 24-24-24 + 6
= 294

so total number of ways when even one of these are not at the said positions = 720-294 = 426 ... option B

I THINK ITS -2(all 3)....i.e-2(TiJiDi)... is it not???
Director
Joined: 27 May 2008
Posts: 540
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 06:13
arjtryarjtry wrote:

I THINK ITS -2(all 3)....i.e-2(TiJiDi)... is it not???

lets get back to basics .... (AnB is 'A intersection B' and AuB is 'A union B')

AuBuC should include everying that is in A, B and C and common areas should be counted only once...

AnB is a part of A
AnB is a part of B

so when we write A+B+C we are actully counting AnB twice .... so we have to substratc AnB once to get the final answer ... similar logic for AnC and BnC ....

AnBnC is a part of A, B, C, AnB, AnC and BnC....
so when we add A+B+C and substract - AnB-AnC-BnC we are adding AnBnC 3times and substraticg it 3 times .... so we have to add it only once to get the final answer....

P(AuBuC)=P(A)+P(B)+P(C) - P(AnB) - P(AnC) - P(BnC) + P(AnBnC)

Last edited by durgesh79 on 30 Jul 2008, 09:38, edited 1 time in total.
Director
Joined: 27 May 2008
Posts: 540
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 06:17
sjgmat wrote:
Hi durgesh79

Thanks for ur quicker and easier approach... i m confused can u point out where I am wrong...

thanks a lot

the difference in your answer (432) and my answer (426) is 6... i guess you missed (or counted twice) TiJiD = 6
Current Student
Joined: 11 May 2008
Posts: 553
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 09:55
HMMM, MY thinking is like this...
if P is all people of grp 1(say)
if Q is all people of gp 2
if R is all people of gp 3,
let common bet'n 1 and 2 be a, betn 2 and 3 be b and betn 3 and 1 be c.
let area of all the three be x.
then people of
[ONLY 1= P-x-a-c ;people of ONLY 2 =Q-x-a-b, .... and ONLY 3=R-x-b-c..]... these are single users
two users= a+b+c
three users = x.
on adding the three,
P-x-a-c+Q-x-a-b+R-x-b-c+a+b+c+2x
= P+Q+R-(a+b+c)-2x...
is there something wrong here... im unable to get it..
Director
Joined: 27 May 2008
Posts: 540
Re: tom and jerry [#permalink]

Show Tags

30 Jul 2008, 10:09
arjtryarjtry wrote:
HMMM, MY thinking is like this...
if P is all people of grp 1(say)
if Q is all people of gp 2
if R is all people of gp 3,
let common bet'n 1 and 2 be a, betn 2 and 3 be b and betn 3 and 1 be c.
let area of all the three be x.
then people of
[ONLY 1= P-x-a-c ;people of ONLY 2 =Q-x-a-b, .... and ONLY 3=R-x-b-c..]... these are single users
two users= a+b+c
three users = x.
on adding the three,
P-x-a-c+Q-x-a-b+R-x-b-c+a+b+c+2x
= P+Q+R-(a+b+c)-2x...
is there something wrong here... im unable to get it..

in you definition on a, b and c you are counting common elements only between two sets ....
1 intersection 2 means all elements common between 1 and 2, this will also include elements which are common between 1, 2 and 3.

so if A = 1 intersection 2
A = a + x => a = A-x
B = b + x => b = B-x
C = C + x => c = C-x

your equestion will become P+Q+R -A-B-C +x
Re: tom and jerry   [#permalink] 30 Jul 2008, 10:09
Display posts from previous: Sort by

Tom, Jerry, and Donald and other three people sit in a line.

 post reply Question banks Downloads My Bookmarks Reviews Important topics

Moderator: chetan2u

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne 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®.