Last visit was: 21 Apr 2026, 15:42 It is currently 21 Apr 2026, 15:42
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
User avatar
kirankp
Joined: 22 Jul 2008
Last visit: 25 Sep 2012
Posts: 57
Own Kudos:
1,366
 [5]
Given Kudos: 11
Location: Bangalore,Karnataka
Posts: 57
Kudos: 1,366
 [5]
2
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
avatar
prome2
Joined: 25 Nov 2009
Last visit: 29 Aug 2010
Posts: 30
Own Kudos:
Given Kudos: 4
Posts: 30
Kudos: 27
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 21 Apr 2026
Posts: 109,728
Own Kudos:
Given Kudos: 105,800
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,728
Kudos: 810,465
 [10]
7
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
User avatar
4test1
Joined: 04 Nov 2009
Last visit: 26 Jul 2010
Posts: 53
Own Kudos:
Given Kudos: 1
Schools:London Business School (int)
WE 1: Research
WE 2: Corporate Strat
Posts: 53
Kudos: 72
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Trying to fully understand Bunuel's method.
When we arrange them all in 24! ways, leg could possibly have 1 shoe + 1 sock, 1 sock + 1 shoe, 2 socks or 2 shoes.

Do we not need to remove out the cases where the leg has only shoes or only socks before imposing the restriction and dividing by 2?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 21 Apr 2026
Posts: 109,728
Own Kudos:
Given Kudos: 105,800
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,728
Kudos: 810,465
Kudos
Add Kudos
Bookmarks
Bookmark this Post
4test1
Trying to fully understand Bunuel's method.
When we arrange them all in 24! ways, leg could possibly have 1 shoe + 1 sock, 1 sock + 1 shoe, 2 socks or 2 shoes.

Do we not need to remove out the cases where the leg has only shoes or only socks before imposing the restriction and dividing by 2?

Leg can not have two socks or two shoes, as each leg has its specific shoe or specific sock. Meaning that shoe and sock is fixed to a certain leg, hence insect can put on one leg ONLY the sock and shoe of THIS leg.

Hope it's clear.
User avatar
kirankp
Joined: 22 Jul 2008
Last visit: 25 Sep 2012
Posts: 57
Own Kudos:
Given Kudos: 11
Location: Bangalore,Karnataka
Posts: 57
Kudos: 1,366
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks Bunuel.. I guessed so that it will be out of GMAT scope.
User avatar
fivedaysleft
Joined: 29 Jun 2011
Last visit: 27 Jun 2014
Posts: 50
Own Kudos:
Given Kudos: 46
Posts: 50
Kudos: 28
Kudos
Add Kudos
Bookmarks
Bookmark this Post
my goodness...this is some heavy question...and i thought i was good at combinations!
bunuel's method of combining combinatorics and probability is sheer genius.
+1!
User avatar
voodoochild
Joined: 16 Feb 2011
Last visit: 14 May 2023
Posts: 144
Own Kudos:
1,161
 [1]
Given Kudos: 78
Schools:ABCD
Posts: 144
Kudos: 1,161
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
This is a very good question. +1.

Also I believe nothing like this will ever occur at real test, as this question is beyond the scope of GMAT.

Anyway here is my solution:

NOTE that each sock and shoe is "assigned" to a specific leg.

Imagine situation with no restriction, meaning no need to put the socks before the shoes. In this case the # of ways insect can put 24 items would be 24!. As we can choose to put ANY of 24 items first, then 23 items left, then 22 and so on.

Next step. On EACH leg we can put either sock OR shoe first. But for EACH leg from 12, only one order is correct WITH restriction: sock first then shoe. For one leg chances of correct order is 1/2, for two legs 1/2^2, similarly for 12 legs chances of correct order would 1/2^12.

So we get that for the total # of ways, WITH NO RESTRICTION, which is 24!, only 1/2^12 is good WITH RESTRICTION.

So the final answer is 24!/2^12.

Answer: C.


Bunuel,
Sorry to open this thread. Why wouldn't it be 12! * 12!? For each of the legs, there are 12 possible socks = 12!. Once the socks are chosen, there are 12 possible shoes = 12!

Therefore, using Fund. Principle of counting, the total permutations should be (12!)^2 ? Correct?
User avatar
mayankdangi
Joined: 15 Apr 2012
Last visit: 16 Sep 2012
Posts: 4
Own Kudos:
Given Kudos: 8
Posts: 4
Kudos: 2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
voodoochild
Bunuel
This is a very good question. +1.

Also I believe nothing like this will ever occur at real test, as this question is beyond the scope of GMAT.

Anyway here is my solution:

NOTE that each sock and shoe is "assigned" to a specific leg.

Imagine situation with no restriction, meaning no need to put the socks before the shoes. In this case the # of ways insect can put 24 items would be 24!. As we can choose to put ANY of 24 items first, then 23 items left, then 22 and so on.

Next step. On EACH leg we can put either sock OR shoe first. But for EACH leg from 12, only one order is correct WITH restriction: sock first then shoe. For one leg chances of correct order is 1/2, for two legs 1/2^2, similarly for 12 legs chances of correct order would 1/2^12.

So we get that for the total # of ways, WITH NO RESTRICTION, which is 24!, only 1/2^12 is good WITH RESTRICTION.

So the final answer is 24!/2^12.

Answer: C.


Bunuel,
Sorry to open this thread. Why wouldn't it be 12! * 12!? For each of the legs, there are 12 possible socks = 12!. Once the socks are chosen, there are 12 possible shoes = 12!

Therefore, using Fund. Principle of counting, the total permutations should be (12!)^2 ? Correct?


hi voodoochild,
For each of the legs, there are possible 24 objects (12 shoes+12 socks) that can be worn. therefore 24!
With the restriction given, in half of the orders, a shoe would be worn before sock and in the other half, a sock would be worn before the shoe .
C seems to be the only option with that restriction.
IMO
24!/2 would be the answer. I dont understand the need to restrict the order i.e (1/2)^12 times.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 21 Apr 2026
Posts: 109,728
Own Kudos:
810,465
 [1]
Given Kudos: 105,800
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,728
Kudos: 810,465
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
OA for this question is C.

BUT: this question is out of the scope of GMAT, so I wouldn't worry about it at all. No need to waste much of your time on it.
User avatar
EvaJager
Joined: 22 Mar 2011
Last visit: 31 Aug 2016
Posts: 513
Own Kudos:
Given Kudos: 43
WE:Science (Education)
Posts: 513
Kudos: 2,370
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
OA for this question is C.

BUT: this is question is out of the scope of GMAT, so I wouldn't worry about it at all. No need to waste much of your time on it.

Hi Bunuel,

I think this is an advanced version of a question I saw on the forum before... something about people standing in a queue and it was about X should stand in front of Y (there were specific names). There were n (some specific number) people altogether, so the number of possibilities was n!/2 (in half of them X was in front of Y and in the other half X wasn't). Can you pull out the question?
The insect question would be a version of the queue question, for example with 24 couples (husbands and wives), and asking for the number of possibilities in which each wife stands in front of her husband.
Or in general: total of \(n\) people in a queue, \(k\) couples (\(2k \leq n\)), each wife standing in front of her husband - number of possible arrangements is \(n!/(2^k)\).

It could be a +700 question on a test...don't you think?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 21 Apr 2026
Posts: 109,728
Own Kudos:
810,465
 [4]
Given Kudos: 105,800
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,728
Kudos: 810,465
 [4]
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
EvaJager
Bunuel
OA for this question is C.

BUT: this is question is out of the scope of GMAT, so I wouldn't worry about it at all. No need to waste much of your time on it.

Hi Bunuel,

I think this is an advanced version of a question I saw on the forum before... something about people standing in a queue and it was about X should stand in front of Y (there were specific names). There were n (some specific number) people altogether, so the number of possibilities was n!/2 (in half of them X was in front of Y and in the other half X wasn't). Can you pull out the question?
The insect question would be a version of the queue question, for example with 24 couples (husbands and wives), and asking for the number of possibilities in which each wife stands in front of her husband.
Or in general: total of \(n\) people in a queue, \(k\) couples (\(2k \leq n\)), each wife standing in front of her husband - number of possible arrangements is \(n!/(2^k)\).

It could be a +700 question on a test...don't you think?

GMAT combination/probability questions are fairly straightforward, so frankly speaking I think that there is 0 chances for this kind of question appearing on the real test.

As for the the question you are talking about, there are several of that kind:
six-mobsters-have-arrived-at-the-theater-for-the-premiere-of-the-126151.html
susan-john-daisy-tim-matt-and-kim-need-to-be-seated-in-130743.html
meg-and-bob-are-among-the-5-participants-in-a-cycling-race-58095.html
in-how-many-different-ways-can-the-letters-a-a-b-91460.html
mary-and-joe-are-to-throw-three-dice-each-the-score-is-the-126407.html
goldenrod-and-no-hope-are-in-a-horse-race-with-6-contestants-82214.html
in-how-many-ways-can-a-teacher-in-a-kindergarten-school-136369.html
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 21 Apr 2026
Posts: 109,728
Own Kudos:
Given Kudos: 105,800
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 109,728
Kudos: 810,465
Kudos
Add Kudos
Bookmarks
Bookmark this Post
obs23
Bunuel
OA for this question is C.

BUT: this question is out of the scope of GMAT, so I wouldn't worry about it at all. No need to waste much of your time on it.

Bunuel, this is tough indeed. Just for the peace of mind, I thought of this question as Leg 1 has 12 socks and 12 shoes, Leg 2 has 11 socks and 11 shoes...etc. Again, it feels a bit more intuitive...what do you think of this approach? I am struggling to put it into the answers and come up with an algebraic way to get to the answer...Would not it be \((12*12)+(11*11)+(10*10)...(1*1)\)? Please share your thoughts...

Hi,

Solution is given here: an-insect-has-one-shoe-and-one-sock-for-each-of-its-twelve-87503.html#p658176

The question is out of the scope of GMAT, so I wouldn't worry about it AT ALL and wouldn't recommend to spend any time studying it.

Topic locked.

Regards,
Bunuel.
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,956
Own Kudos:
Posts: 38,956
Kudos: 1,117
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Automated notice from GMAT Club BumpBot:

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

This post was generated automatically.
Moderator:
Math Expert
109728 posts