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 →

Counting - Six mobsters

Expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
Senior | Next Rank: 100 Posts
Posts: 57
Joined: Fri Oct 01, 2010 7:34 am
Location: Pune, India
Thanked: 1 times
GMAT Score:680

by Taran » Mon Dec 13, 2010 10:26 pm
@sanjana - You did it the right way. You however made an error while adding up the different combinations. :)
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Newbie | Next Rank: 10 Posts
Posts: 7
Joined: Sat Feb 26, 2011 1:21 pm
Thanked: 1 times

by gmat3last » Tue Mar 22, 2011 5:59 am
HELP...I know this is a little off-topic, but I could not find think of a better place to discuss a math problem (since am a newbie)

Question: How many different positive divisors are there to 2600?
Can anyone show me the quickest way to solve this?
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Junior | Next Rank: 30 Posts
Posts: 11
Joined: Sun Jan 09, 2011 2:25 amFollowed by: 1 member
GMAT Score:680

by Aditya57 » Thu May 26, 2011 10:28 am
Sanjana ,your reasoning is right and sum it up in the manner, 120+96+72+48+24 equals 360 only ,not 350 B-) and my reasoning goes as
5! for Frankie standing last in line
4*4! for Frankie being 5th in line
3*4! for Frankie being 4th in line
2*4! for being 3rd in line
1*4! for being 2nd in line
-----
4! for the four positions other than Frankie and Joey in line ,remaning numbers for the number of positions Joey can stand in the line ,
so (4+3+2+1)*4! + 5!= 360
and simpler one is 6!/2 ,a 50-50 chance ! Thanks
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Junior | Next Rank: 30 Posts
Posts: 11
Joined: Sun Jan 09, 2011 2:25 amFollowed by: 1 member
GMAT Score:680

by Aditya57 » Thu May 26, 2011 10:36 am
gmat3last wrote:HELP...I know this is a little off-topic, but I could not find think of a better place to discuss a math problem (since am a newbie)

Question: How many different positive divisors are there to 2600?
Can anyone show me the quickest way to solve this?
---------------------------
Hey it's a simple one take the number given,
1. express the number as product prime factors.
2. exponent the common factor and writing the prime factors as powers.
3. add 1 to number of times each prime factor is present.
4. multiply them and that is your answer.
ex: 2600
can be expressed as 2*2*2*5*5*13
= (2^3)*(5^2)*(13^1)
=(3+1)*(2+1)*(1+1)
=4*3*2
= 24 divisors
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Legendary Member
Posts: 608
Joined: Sun Jun 19, 2011 11:16 amFollowed by: 8 members
Thanked: 37 times

by saketk » Thu Aug 25, 2011 8:05 pm
Starting with the first position-- If frankie is in 1st pos.. rest 5 can arrange themselves in 5! ways...
likewise there will be 4 more case-- and the resultant of these cases will be

4! (1+2+3+4) = 240

Total = 240+5! = 240+120 = 360 :)
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 96
Joined: Fri Apr 23, 2010 1:14 amFollowed by: 1 member
Thanked: 1 times

by quantskillsgmat » Thu Aug 25, 2011 9:49 pm
i think problem is same as
in how many ways abcdef can be arranged so that a is always ahead of b.(there may be zero or more persons between a and b.)
answer is 360
becz when n different thing arranged in a line theny can be arranged in n factorial ways.and every element has half of the cases before it and half behind it.
so desired answer is 6 factorial/2=360
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 96
Joined: Fri Apr 23, 2010 1:14 amFollowed by: 1 member
Thanked: 1 times

by quantskillsgmat » Thu Aug 25, 2011 10:42 pm
this was easy questionwhat else. if conditions are something different
eg
abcdef is to be arranged in a line in how any ways it can be done if a is ahead of b and b is ahead of c.
i think answer shd be 6!/2!x2!
am i ryt bent
thanx
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Senior | Next Rank: 100 Posts
Posts: 31
Joined: Thu Aug 12, 2010 12:40 amFollowed by: 1 member
Thanked: 1 times

by olegpoi » Fri Aug 26, 2011 1:51 pm
360

There are 5 positions in the stand for F to keep his eye on J:
6th 5*4*3*2*1x1=120
5th 4x4*3*2x1x1=96
4th 3x4*3x1x2*1=72
3rd 2x4x1x3*2*1=48
2nd 1x1x4*3*2*1=24
Total of scenarios =360
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Senior | Next Rank: 100 Posts
Posts: 53
Joined: Sun Apr 10, 2011 12:15 pm
Thanked: 1 times

by Deependra1 » Sun Sep 04, 2011 3:51 am
ANSWER: D
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 504
Joined: Tue Apr 19, 2011 1:40 pmFollowed by: 11 members
Thanked: 114 times

by knight247 » Sun Sep 04, 2011 1:14 pm
I kinda tried solving this using only elimination.

If no restrictions then they can be arranged in 6! ways=720 so that eliminates E

If Frank is always behind Joe then we consider them as one. I'm writing them as JF and the other mobsters as M1 M2 etc

JF M1 M2 M3 M4
These can be arranged in 5! ways =120. However there are other permutations to be considered as well. So the actual figure is much greater than 120. So that eliminates A, B and C. Hence D
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 101
Joined: Thu Aug 25, 2011 9:39 pm

by prashant misra » Thu Sep 08, 2011 9:01 am
my oficial answer is also 360.thank god i did the question through my logic
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Junior | Next Rank: 30 Posts
Posts: 27
Joined: Tue Mar 08, 2011 7:41 am
Thanked: 1 times

by jsnipes » Wed Sep 21, 2011 6:32 pm
i got the right answer but i think i may have done it wrong. so total number of ways that the 6 people can be arranged (since order matters?) is 6! or 720. i then took 720 and divided it by the number of people who have to stand together as 2! not two. so i got 6!/2! which for 2 is obviously the same thing and results in the correct answer of 360. if there were three people would I divide 720 by 3 or 3!

thanks for help, i know this is two day old question i just got around to answering it though.
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Master | Next Rank: 500 Posts
Posts: 197
Joined: Thu Sep 15, 2011 10:22 amFollowed by: 2 members
Thanked: 6 times

by parul9 » Thu Sep 29, 2011 9:46 am
I got he answer right - 360.
but I solved it the long way...
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Senior | Next Rank: 100 Posts
Posts: 63
Joined: Sat Dec 24, 2011 9:47 am
Location: India

by him1985 » Sun Jan 29, 2012 3:36 am
Good question indeed!!
Brent@GMATPrepNow wrote:I recently came across this question, and I quite like it.

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, though not necessarily right behind him. 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
Himanshu Chauhan
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
User avatar
Legendary Member
Posts: 626
Joined: Fri Dec 23, 2011 2:50 amFollowed by: 10 members
Location: Ahmedabad
Thanked: 31 times

by ronnie1985 » Sun Jan 29, 2012 10:44 am
The shortcut is very difficult to strike at exam time. the long method although long takes short time for calculation. I would have gone for the longer method rather than short one during exam as it yields accuracy and confidence.
Follow your passion, Success as perceived by others shall follow you
Top
Join the discussion
Log in to postLogin with Googleuse password
QUOTE IN REPLY
Post new topic Post Reply