It is currently 17 Nov 2017, 13:07

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

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Six mobsters have arrived at the theater for the premiere of

  post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Director
Director
User avatar
Joined: 16 May 2007
Posts: 547

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

Six mobsters have arrived at the theater for the premiere of [#permalink]

Show Tags

New post 24 Jul 2007, 07:08
11
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  55% (hard)

Question Stats:

51% (00:48) correct 49% (00:31) wrong based on 259 sessions

HideShow timer Statistics

Six mobsters have arrived at the theater for the premiere of the film “Goodbuddies.” One of the mobsters, Frankie, is an informer, and he's afraid that another member of his crew, Joey, is on to him. Frankie, wanting to keep Joey in his sights, insists upon standing behind Joey in line at the concession stand. How many ways can the six arrange themselves in line such that Frankie’s requirement is satisfied?

A. 6
B. 24
C. 120
D. 360
E. 720

OPEN DISCUSSION OF THIS QUESTION IS HERE: six-mobsters-have-arrived-at-the-theater-for-the-premiere-of-the-126151.html
[Reveal] Spoiler: OA

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

11 KUDOS received
Senior Manager
Senior Manager
avatar
Joined: 15 Aug 2007
Posts: 252

Kudos [?]: 72 [11], given: 0

Schools: Chicago Booth
Re: PS: Combinatorics [#permalink]

Show Tags

New post 18 Mar 2008, 22:28
11
This post received
KUDOS
360

If Joey is in 6th spot, Frank can stand anywhere from 1-5 - rest can be arranged in 4! ways - total 5*4!
If Joey is in 5th spot, Frank can stand anywhere from 1-4 - rest can be arranged in 4! ways - total 4*4!
.
.
Total number of arrangments = (1+2+3+4+5)*4! = 360

Kudos [?]: 72 [11], given: 0

6 KUDOS received
SVP
SVP
avatar
Joined: 21 Jul 2006
Posts: 1512

Kudos [?]: 1050 [6], given: 1

 [#permalink]

Show Tags

New post 02 Dec 2007, 10:38
6
This post received
KUDOS
I think this is the clearest way to look at it:

JF1234
12JF34
1234JF

Since JF is considered 1 group, the total number of combinations would be 5!. Since there are 3 ways in which JF can be together, we multiply 5! by 3, therefore:

5!*3= 360

hope that's clearer now

Kudos [?]: 1050 [6], given: 1

2 KUDOS received
Manager
Manager
avatar
Joined: 10 Apr 2008
Posts: 53

Kudos [?]: 7 [2], given: 4

Re: Mobsters going for a movie [#permalink]

Show Tags

New post 13 Sep 2008, 19:14
2
This post received
KUDOS
Here's how I did it, but it seems long and cumbersome so hopefully someone can provide a better explanation.

There are 6 possible positions for each mobster. Frankie depends on Joey so select those first

1. Joey at 1; 5! for rest
2. Joey at 2; 4 choices for 1 (6-joey-frankie); 4! for rest
3. Joey at 3; 4*3 choices for 1-2; 3! for rest
4. Joey at 4; 4*3*2 choices for 1-3; 2! for rest
5. Joey at 5; 4*3*2*1 choice for 1-4; 1 for rest

So total = 5! + 4x4! + 4*3*3! + 4*3*2*2! + 4!
= 5(4!) + 4(4!) + 3(4!) + 2(4!) + (4!)
= 4! x (5 + 4 + 3 + 2 + 1)
= 24 * 15
= 360


So D.

Kudos [?]: 7 [2], given: 4

2 KUDOS received
Manager
Manager
avatar
Joined: 04 Feb 2010
Posts: 196

Kudos [?]: 22 [2], given: 8

CAT Tests
Re: 700-800 Combinatorics hard concept [#permalink]

Show Tags

New post 05 Jul 2010, 13:27
2
This post received
KUDOS
Here's the answer.

There are fifteen ways F would be behind J all the time. Think of it this way. There are six places, and you have to select two places for F & J, and where the other four's positions does not matter. This can be put into numbers as 6!/4!2! giving us 15.

So you'd have the following:

FJ????, F?J???, F??J??, F???J?, F????J
?FJ???, ?F?J??, ?F??J?, ?F???J
??FJ??, ??F?J?, ??F??J
???FJ?, ???F?J
????FJ

15 scenarios in all.

Now, you can use counting techniques to get all the possible orders of the four remaining mobsters. That would be 4! = 24.

Multiply the 15 cases with all of the possible orders of the four remaining mobsters - 15*24 = 360.

Kudos [?]: 22 [2], given: 8

1 KUDOS received
SVP
SVP
User avatar
Joined: 29 Aug 2007
Posts: 2471

Kudos [?]: 853 [1], given: 19

Re: Combination [#permalink]

Show Tags

New post 24 Nov 2007, 13:54
1
This post received
KUDOS
tarek99 wrote:
Six mobsters have arrived at the theater for the premiere of the film “Goodbuddies.” One of the mobsters, Frankie, is an informer, and he's afraid that another member of his crew, Joey, is on to him. Frankie, wanting to keep Joey in his sights, insists upon standing behind Joey in line at the concession stand. How many ways can the six arrange themselves in line such that Frankie’s requirement is satisfied?

a) 6
b) 24
c) 120
d) 360
e) 720

I really don't know how to approach this problem. Would anyone show me how? appreciate it!


1. If JF are adjacent to each other = 5! = 120
1. If F is behind but not adjcent to J = 3 x 5! = 360

Kudos [?]: 853 [1], given: 19

Expert Post
1 KUDOS received
CEO
CEO
User avatar
Joined: 17 Nov 2007
Posts: 3583

Kudos [?]: 4661 [1], given: 360

Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
GMAT ToolKit User Premium Member
 [#permalink]

Show Tags

New post 01 Dec 2007, 08:41
1
This post received
KUDOS
Expert's post
shortcut:

every cases is JF or FJ. Therefore, we should (total number of combination) divide by 2 (due to symmetry)

6!/2=5!*3=360

Kudos [?]: 4661 [1], given: 360

1 KUDOS received
Senior Manager
Senior Manager
avatar
Joined: 04 Jun 2008
Posts: 286

Kudos [?]: 158 [1], given: 15

Re: arrangment problem [#permalink]

Show Tags

New post 18 Jul 2009, 12:13
1
This post received
KUDOS
F must be behind J and the others 4 can stand in any way.

Say J stands in 1st place, ie, in front of all others. Then F can stand anywhere behind in 5 ways, and others in !4 ways.

If J stands in 2nd place, F can stand in any of the remaining 4 places behind J in 4 ways, and all others can again arrange in !4

J - 3rd place, F - stand in 3 places in 3 ways and others in !4....

J in 4th and 5th, F in 2 and 1 way respectively, and others in !4 each time.

So total number of ways is by adding all of the above.

!4 (5+4+3+2+1) = 360

Kudos [?]: 158 [1], given: 15

1 KUDOS received
Kaplan GMAT Instructor
User avatar
Joined: 21 Jun 2010
Posts: 73

Kudos [?]: 194 [1], given: 2

Location: Toronto
Re: 700-800 Combinatorics hard concept [#permalink]

Show Tags

New post 05 Jul 2010, 15:15
1
This post received
KUDOS
Quote:
I have a hard time grasping the concept that half of the time F would be behind J. Can someone please explain this to me?


Hi,

maybe this will help:

take 2 objects, x and y. How many ways to arrange them?

Clearly, 2: xy and yx. Notice that in half the arrangements (1 out of 2) x is before y, and in the other half y is before x.

Take 3 objects, x, w, and y. There are 3! or 6 arrangements. In half (ie, 3) of those arrangements, x is before w, while in the other half w before x. Likewise, in half of the arrangements x is before y while in the other half y before x. And, also, in half the arrangements, w is before y while in the other half y before w.

Why would it be the case that Joey can be arranged ahead of Frankie more or less often than Frankie can be arranged ahead of Joey? Why not the other way around? :wink:

So, here, the easiest way to solve is certainly to take just half of the total arrangements: 6!/2 = 360, and choose D.

Quote:
Also, can this be down using straight combinations without getting the concept that half of the time F would be behind J?


Yes, it certainly can as the above poster demonstrated!

But many combinatorics questions on the GMAT resist pure formulaic treatment. A little bit of reasoning on these questions can save you an immense amount of time!

Kudos [?]: 194 [1], given: 2

1 KUDOS received
TOEFL Forum Moderator
avatar
Joined: 16 Nov 2010
Posts: 1602

Kudos [?]: 599 [1], given: 40

Location: United States (IN)
Concentration: Strategy, Technology
Reviews Badge
Re: Permutation & Combination [#permalink]

Show Tags

New post 03 Apr 2011, 17:52
1
This post received
KUDOS
J in 1 then the remaining in 5! ways = 120

J in 2 then F in 4 ways and the remaning in 4! ways = 24 * 4 = 96

J in 3 then F in 3 ways and remaining in 4! way = 24 * 3 = 72

J in 4 then F in 2 ways and remaining in 4! way = 24 * 2 = 48


J in 5 then F in 1 way and remaining in 4! way = 24 * 1 = 24

So total = 120 + 96 + 72 + 48 + 24 = 360

Answer - D
_________________

Formula of Life -> Achievement/Potential = k * Happiness (where k is a constant)

GMAT Club Premium Membership - big benefits and savings

Kudos [?]: 599 [1], given: 40

Expert Post
1 KUDOS received
Veritas Prep GMAT Instructor
User avatar
G
Joined: 16 Oct 2010
Posts: 7736

Kudos [?]: 17766 [1], given: 235

Location: Pune, India
Re: Permutation & Combination [#permalink]

Show Tags

New post 24 Apr 2011, 16:09
1
This post received
KUDOS
Expert's post
2
This post was
BOOKMARKED
dumluck wrote:
Sorry to drag this post up again, but rather than start a new one. I understand that 6! is the number of combinations. However, the question explicitly states that Frankie has to be behind Joey (not directly but certainely behind). So why are we dividing by 2? As in; the probability that Frankie will be behind Joey and the probability that Frankie will be ahead of Joey if we are only concerned with the former (i.e Frankie behind Joey)?

Apologies, but I'm just not getting it.


The important thing to realize here is that Frankie and Joey are absolutely identical elements of this arrangement.
Say, I have 3 elements: A, B and C
I can arrange them in 3! ways:

ABC
ACB
BAC
BCA
CAB
CBA
Look at them carefully. In 3 of them A is before B and in other 3, B is before A. It will be this way because A and B are equal elements. There is no reason why A should be before B in more cases than B before A. Similarly, you can compare B and C or A and C.
Hence, when we arrange all 6 people in 6! ways, in half of them Frankie will be before Joey and in other half, Joey will be before Frankie.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199

Veritas Prep Reviews

Kudos [?]: 17766 [1], given: 235

1 KUDOS received
Manager
Manager
avatar
Status: Do till 740 :)
Joined: 13 Jun 2011
Posts: 108

Kudos [?]: 13 [1], given: 19

Concentration: Strategy, General Management
GMAT 1: 460 Q35 V20
GPA: 3.6
WE: Consulting (Computer Software)
GMAT ToolKit User
Re: Arrangements(Combinatorics): Six mobsters for Goodbuddies [#permalink]

Show Tags

New post 14 Sep 2011, 12:38
1
This post received
KUDOS
D : 360 is the right answer

Here it goes

- - - - - -

Six places to be filled ,so we need to make sure J and F meet the criteria such that F is always behind J

so 6C2 will give the possible combinations for this placement and the rest 4 can be arranged in 4! ways
hence
360

Kudos [?]: 13 [1], given: 19

1 KUDOS received
Manager
Manager
avatar
Joined: 10 Oct 2011
Posts: 119

Kudos [?]: 74 [1], given: 7

Location: India
Concentration: Technology, Entrepreneurship
GMAT 1: 760 Q50 V42
GPA: 3
Re: Arrangements(Combinatorics): Six mobsters for Goodbuddies [#permalink]

Show Tags

New post 12 Oct 2011, 14:12
1
This post received
KUDOS
The questions says that frank is behind george, that in no way means they are together, next to each other.

the cases would be :-


1. G||||| : F could be anywhere behind G, so 5! ways +
2.XG|||| : F could be any one of |, so 4* 4! ways +
3.XXG||| : F could be any one of |, so 4*3*3! ways
4.XXXG|| : F could be any one of |, so 4*3*2*2! ways
5.XXXXG| : F could be just |, so 4*3*2*1*1! ways


adding 1,2,3,4,5, it comesa to 120+96+72+48+24 = 360. answer option D.
_________________

Paras.

If you found my post helpful give KUDOS!!! Everytime you thank me but don't give Kudos, an Angel dies!

My GMAT Debrief:

I am now providing personalized one to one GMAT coaching over Skype at a nominal fee. Hurry up to get an early bird discount! Send me an IM to know more.

Kudos [?]: 74 [1], given: 7

Senior Manager
Senior Manager
avatar
Joined: 04 Jun 2007
Posts: 344

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

Re: PS: Mobsters [#permalink]

Show Tags

New post 24 Jul 2007, 07:13
trahul4 wrote:
Six mobsters have arrived at the theater for the premiere of the film “Goodbuddies.” One of the mobsters, Frankie, is an informer, and he's afraid that another member of his crew, Joey, is on to him. Frankie, wanting to keep Joey in his sights, insists upon standing behind Joey in line at the concession stand. How many ways can the six arrange themselves in line such that Frankie’s requirement is satisfied?

A.6
B.24
C.120
D.360
E.720


Since F and J are to be always together, number of arrangements is 5! (considering JF as one). Hence, 120 is the answer.

Here is a discussion thread for the same problem:
http://www.gmatclub.com/phpbb/viewtopic.php?t=45097&highlight=mobster

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

GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 07 Jul 2004
Posts: 5032

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

Location: Singapore
 [#permalink]

Show Tags

New post 24 Jul 2007, 07:23
Since Frankie and Joey must always be in a certain order, we can take them as one entity.

So the number of ways to arrange them = 5! = 120

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

Director
Director
User avatar
Joined: 16 May 2007
Posts: 547

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

 [#permalink]

Show Tags

New post 24 Jul 2007, 07:44
2
This post was
BOOKMARKED
Yes looks very easy problem.
But OA is 360. I got this question in one of the MGMAT CAT and was surprised to see 120 worng. Anyways here is the explaination given by MGMAT.

Ignoring Frankie's requirement for a moment, observe that the six mobsters can be arranged 6! or 6 x 5 x 4 x 3 x 2 x 1 = 720 different ways in the concession stand line. In each of those 720 arrangements, Frankie must be either ahead of or behind Joey. Logically, since the combinations favor neither Frankie nor Joey, each would be behind the other in precisely half of the arrangements. Therefore, in order to satisfy Frankie's requirement, the six mobsters could be arranged in 720/2 = 360 different ways.

The correct answer is D.

I feel this soultion given by MGMAT is incorrect.

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

GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 07 Jul 2004
Posts: 5032

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

Location: Singapore
 [#permalink]

Show Tags

New post 24 Jul 2007, 08:02
trahul4 wrote:
Yes looks very easy problem.
But OA is 360. I got this question in one of the MGMAT CAT and was surprised to see 120 worng. Anyways here is the explaination given by MGMAT.

Ignoring Frankie's requirement for a moment, observe that the six mobsters can be arranged 6! or 6 x 5 x 4 x 3 x 2 x 1 = 720 different ways in the concession stand line. In each of those 720 arrangements, Frankie must be either ahead of or behind Joey. Logically, since the combinations favor neither Frankie nor Joey, each would be behind the other in precisely half of the arrangements. Therefore, in order to satisfy Frankie's requirement, the six mobsters could be arranged in 720/2 = 360 different ways.

The correct answer is D.

I feel this soultion given by MGMAT is incorrect.


Sounds dodgy.. okay, let's try the long-winded way. We know Frankie always wants to stand behind Joey.

So,
- if Joey is first in the queue, Frankie must be second. The remaining 4 mobsters can be arranged 4! ways.

- if Joey is second in the queue, Frankie must be third. The remaining 4 mobsters can be arranged 4! ways.

- if Joey is third in the queue, Frankie must be fourth. The remaining 4 mobsters can be arranged 4! ways.

- if Joey is fourth in the queue, Frankie must be fifth. The remaining 4 mobsters can be arranged 4! ways.

- if Joey is fifth in the queue, Frankie must be last. The remaining 4 mobsters can be arranged 4! ways.

So total = 5 * 4! = 120

This method should be foolproof as we are just shifting the pair along the queue. Don't see how you can get 360.

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

Director
Director
User avatar
Joined: 16 May 2007
Posts: 547

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

 [#permalink]

Show Tags

New post 24 Jul 2007, 08:13
I agree with you. I think the OA given by MGMAT is wrong and my answer on the CAT was correct. :wink:

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

Manager
Manager
avatar
Joined: 08 Jul 2007
Posts: 173

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

 [#permalink]

Show Tags

New post 24 Jul 2007, 08:48
trahul4 wrote:
I agree with you. I think the OA given by MGMAT is wrong and my answer on the CAT was correct. :wink:


I had the same problem with MGMAT. This problem has been discussed several times on this board. MGMAT is actually asking how many ways for Frankie to be behind Joey but not directly behind him. Thus, the ways of arranging the 6 people is 6!=720 and Frankie is behind Joey 1/2 of the times so the answer is 360. The answer allows for there to be mobsters between Joey and Frankie.

MGMAT was not clear on this question in my opinion. However, since they did not specify "directly behind" then I guess their answer is okay.

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

Manager
Manager
User avatar
Joined: 27 May 2007
Posts: 128

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

 [#permalink]

Show Tags

New post 26 Jul 2007, 19:06
I hope the wording isn't this tricky on the actual test! I also got 120 until I read the explanation, assuming behind meant directly behind.

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

  [#permalink] 26 Jul 2007, 19:06

Go to page    1   2   3    Next  [ 43 posts ] 

Display posts from previous: Sort by

Six mobsters have arrived at the theater for the premiere of

  post reply Question banks Downloads My Bookmarks Reviews Important topics  


cron

GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

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®.