Last visit was: 19 Nov 2025, 23:10 It is currently 19 Nov 2025, 23:10
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
   1   2 
Theory|   
User avatar
walker
User avatar
Joined: 17 Nov 2007
Last visit: 25 May 2025
Posts: 2,398
Own Kudos:
10,717
Given Kudos: 362
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Expert
Expert reply
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Posts: 2,398
Kudos: 10,717
Math: Combinatorics 04 Dec 2011, 07:17
Kudos
Add Kudos
Bookmarks
Bookmark this Post
...k objects taken from a set of n distinct objects....

so k is always less or equal N by definition.
avatar
Yekrut
avatar
Joined: 02 Feb 2012
Last visit: 12 Mar 2019
Posts: 153
Own Kudos:
9
Given Kudos: 105
Location: United States
Schools: Sloan '19 (WD) Haas '19 (WD) HBS '19 (D) Booth '19 (WD) CBS '19 (M$) Stern '19 (A)
GMAT 1: 770 Q49 V47
GPA: 3.08
Schools: Sloan '19 (WD) Haas '19 (WD) HBS '19 (D) Booth '19 (WD) CBS '19 (M$) Stern '19 (A)
GMAT 1: 770 Q49 V47
Posts: 153
Kudos: 9
Math: Combinatorics 14 Mar 2012, 16:34
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thank you for this post! Very helpful!
User avatar
catty2004
User avatar
Joined: 30 May 2008
Last visit: 01 Nov 2016
Posts: 35
Own Kudos:
966
 [1]
Given Kudos: 26
Posts: 35
Kudos: 966
 [1]
Math: Combinatorics 11 Apr 2012, 23:29
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
walker
The topic is not finished.

COMBINATORICS

created by: walker
edited by: bb, Bunuel

--------------------------------------------------------

This post is a part of [GMAT MATH BOOK]



--------------------------------------------------------

Circular arrangements

Let's say we have 6 distinct objects, how many relatively different arrangements do we have if those objects should be placed in a circle.



The difference between placement in a row and that in a circle is following: if we shift all object by one position, we will get different arrangement in a row but the same relative arrangement in a circle. So, for the number of circular arrangements of n objects we have:
\(R = \frac{n!}{n} = (n-1)!\)
Tips and Tricks

Any problem in Combinatorics is a counting problem. Therefore, a key to solution is a way how to count the number of arrangements. It sounds obvious but a lot of people begin approaching to a problem with thoughts like "Should I apply C- or P- formula here?". Don't fall in this trap: define how you are going to count arrangements first, realize that your way is right and you don't miss something important, and only then use C- or P- formula if you need them.


Resources

Walker's post with Combinatorics/probability problems: [Combinatorics/probability Problems]

--------------------------------------------------------

Show SpoilerImages
Attachment:
Math_Combinatorics_6balls.png
Attachment:
Math_Combinatorics_6balls_b.png
Attachment:
Math_Combinatorics_6balls_l.png
Attachment:
Math_Comb_Round_t.png
Show more


having a hard time understand the formula under circular arrangement :(
avatar
AlyoshaKaramazov
avatar
Joined: 25 Jun 2012
Last visit: 10 Jul 2015
Posts: 27
Own Kudos:
71
 [4]
Given Kudos: 4
Posts: 27
Kudos: 71
 [4]
Math: Combinatorics 04 Dec 2012, 20:26
1
Kudos
Add Kudos
3
Bookmarks
Bookmark this Post
just wanted to throw these videos from khan academy out there, super helpful in dumbing down the concepts and holding your hand through it

combinations:

https://www.khanacademy.org/math/probabi ... inations_1

permutations:

https://www.khanacademy.org/math/probabi ... utations_1

These should be required watching, MGMAT does a thorough job of confusing my ass in this area.
User avatar
tanveer123
User avatar
Joined: 01 Sep 2012
Last visit: 30 May 2014
Posts: 8
Own Kudos:
5
Given Kudos: 19
Location: United States
Posts: 8
Kudos: 5
Math: Combinatorics 17 Mar 2013, 00:07
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Great post., Many thanks!!
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,397
Own Kudos:
778,405
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,397
Kudos: 778,405
Math: Combinatorics 11 Jul 2013, 00:07
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bumping for review*.

*New project from GMAT Club!!! Check HERE

All Theory Topics: search.php?search_id=tag&tag_id=351
MATH BOOK: gmat-math-book-87417.html
User avatar
russ9
User avatar
Joined: 15 Aug 2013
Last visit: 20 Apr 2015
Posts: 174
Own Kudos:
400
Given Kudos: 23
Posts: 174
Kudos: 400
Math: Combinatorics 07 Sep 2013, 20:03
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi - I'm a little confused by the last part of the explanation above:

"here is a basket with 4 blue balls, 3 red balls and 2 yellow balls. The balls of the same color are identical. How many ways can a child pick balls out of this basket ?

Solution
We combine techniques from the 2 cases above. Consider the blue balls as one entity and instead of asking the yes/no question, ask the question how many ways to choose the balls ? This is answered using the second case, and the answer is (4+1). Combining this with the ways to choose red and yellow balls, the overall ways to choose balls would be (4+1)*(3+1)*(2+1)."

What is the + 1 for and how can we just multiply the 3 sets - 4*3*2? Can't the child pick all 4 blue and no red etc?
User avatar
Narenn
User avatar
Major Poster
Joined: 22 Feb 2012
Last visit: 19 Nov 2025
Posts: 9,170
Own Kudos:
11,074
Given Kudos: 4,651
Affiliations: GMAT Club
Test: Test
Products:
GMAT Club Tests
Expert
Expert reply
Posts: 9,170
Kudos: 11,074
Math: Combinatorics 08 Sep 2013, 19:39
Kudos
Add Kudos
Bookmarks
Bookmark this Post
russ9
What is the + 1 for and how can we just multiply the 3 sets - 4*3*2? Can't the child pick all 4 blue and no red etc?
Show more

+1 is for NOT choosing any of the n identical balls.

Hope that helps :)
Attachments

Untitled123.png
Untitled123.png [ 10.2 KiB | Viewed 14566 times ]

User avatar
russ9
User avatar
Joined: 15 Aug 2013
Last visit: 20 Apr 2015
Posts: 174
Own Kudos:
400
Given Kudos: 23
Posts: 174
Kudos: 400
Math: Combinatorics 06 Apr 2014, 13:42
Kudos
Add Kudos
Bookmarks
Bookmark this Post
walker


Combination

A combination is an unordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(C^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n!
2. Now we have to exclude all arrangements of k objects (k!) and remaining (n-k) objects ((n-k)!) as the order of chosen k objects and remained (n-k) objects doesn't matter.

\(C^n_k = \frac{n!}{k!(n-k)!}\)



Permutation

A permutation is an ordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(P^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n!
2. Now we have to exclude all arrangements of remaining (n-k) objects ((n-k)!) as the order of remained (n-k) objects doesn't matter.

\(P^n_k = \frac{n!}{(n-k)!}\)

If we exclude order of chosen objects from permutation formula, we will get combination formula:

\(\frac{P^n_k}{k!} = C^n_k\)

Show more

Hello friends - this page seems to be the best find yet. I've been using Manhattan gmat books and their content on Combinatorics and Probability is pretty lacking so please excuse my rudimentary questions.

One topic that i'm having a very hard time grasping is the "ordered vs. unordered" set. Seems like Permutation is ordered and Combination is unordered. I have absolutely no clue what that means and more importantly, I can't connect the dots to figure out why it affects the equations the way it does?

Any help would be appreciated.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,397
Own Kudos:
778,405
 [2]
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,397
Kudos: 778,405
 [2]
Math: Combinatorics 06 Apr 2014, 13:56
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
russ9
walker


Combination

A combination is an unordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(C^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n!
2. Now we have to exclude all arrangements of k objects (k!) and remaining (n-k) objects ((n-k)!) as the order of chosen k objects and remained (n-k) objects doesn't matter.

\(C^n_k = \frac{n!}{k!(n-k)!}\)



Permutation

A permutation is an ordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(P^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n!
2. Now we have to exclude all arrangements of remaining (n-k) objects ((n-k)!) as the order of remained (n-k) objects doesn't matter.

\(P^n_k = \frac{n!}{(n-k)!}\)

If we exclude order of chosen objects from permutation formula, we will get combination formula:

\(\frac{P^n_k}{k!} = C^n_k\)


Hello friends - this page seems to be the best find yet. I've been using Manhattan gmat books and their content on Combinatorics and Probability is pretty lacking so please excuse my rudimentary questions.

One topic that i'm having a very hard time grasping is the "ordered vs. unordered" set. Seems like Permutation is ordered and Combination is unordered. I have absolutely no clue what that means and more importantly, I can't connect the dots to figure out why it affects the equations the way it does?

Any help would be appreciated.
Show more

In how many way we can choose two letters out of {a, b, c}, of the order of the letters does not matter?

{a, b}
{a, c}
{b, c}

So, in 3 ways: \(C^2_3=3\).

In how many way we can choose two letters out of {a, b, c}, of the order of the letters matters?

{a, b}
{b, a}
{a, c}
{c, a}
{b, c}
{c, b}

So, in 6 ways: \(P^2_3=6\).

I'd advice to go through easier questions on the topic to understand better. Check here: ds-question-directory-by-topic-difficulty-128728.html and here: gmat-ps-question-directory-by-topic-difficulty-127957.html

Hope it helps.
User avatar
russ9
User avatar
Joined: 15 Aug 2013
Last visit: 20 Apr 2015
Posts: 174
Own Kudos:
400
Given Kudos: 23
Posts: 174
Kudos: 400
Math: Combinatorics 06 Apr 2014, 14:08
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
russ9
walker


Combination

A combination is an unordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(C^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n!
2. Now we have to exclude all arrangements of k objects (k!) and remaining (n-k) objects ((n-k)!) as the order of chosen k objects and remained (n-k) objects doesn't matter.

\(C^n_k = \frac{n!}{k!(n-k)!}\)



Permutation

A permutation is an ordered collection of k objects taken from a set of n distinct objects. The number of ways how we can choose k objects out of n distinct objects is denoted as:

\(P^n_k\)

knowing how to find the number of arrangements of n distinct objects we can easily find formula for combination:

1. The total number of arrangements of n distinct objects is n!
2. Now we have to exclude all arrangements of remaining (n-k) objects ((n-k)!) as the order of remained (n-k) objects doesn't matter.

\(P^n_k = \frac{n!}{(n-k)!}\)

If we exclude order of chosen objects from permutation formula, we will get combination formula:

\(\frac{P^n_k}{k!} = C^n_k\)


Hello friends - this page seems to be the best find yet. I've been using Manhattan gmat books and their content on Combinatorics and Probability is pretty lacking so please excuse my rudimentary questions.

One topic that i'm having a very hard time grasping is the "ordered vs. unordered" set. Seems like Permutation is ordered and Combination is unordered. I have absolutely no clue what that means and more importantly, I can't connect the dots to figure out why it affects the equations the way it does?

Any help would be appreciated.

In how many way we can choose two letters out of {a, b, c}, of the order of the letters does not matter?

{a, b}
{a, c}
{b, c}

So, in 3 ways: \(C^2_3=3\).

In how many way we can choose two letters out of {a, b, c}, of the order of the letters matters?

{a, b}
{b, a}
{a, c}
{c, a}
{b, c}
{c, b}

So, in 6 ways: \(P^2_3=6\).

I'd advice to go through easier questions on the topic to understand better. Check here: ds-question-directory-by-topic-difficulty-128728.html and here: gmat-ps-question-directory-by-topic-difficulty-127957.html

Hope it helps.
Show more

Thanks for the tips. I'll work on doing the easier questions. Cheers.
avatar
AA2014
avatar
Current Student
Joined: 25 Nov 2014
Last visit: 22 Aug 2019
Posts: 146
Own Kudos:
51
Given Kudos: 82
WE:Engineering (Manufacturing)
Products:
My Reviews
Posts: 146
Kudos: 51
Math: Combinatorics 07 Aug 2015, 23:27
Kudos
Add Kudos
Bookmarks
Bookmark this Post
can u please share something like this on "Probability" as well?????
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,397
Own Kudos:
778,405
 [1]
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,397
Kudos: 778,405
 [1]
Math: Combinatorics 16 Aug 2015, 10:09
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
AA2014
can u please share something like this on "Probability" as well?????
Show more

Check here: math-probability-87244.html
User avatar
kuvshah
User avatar
Joined: 05 Jan 2017
Last visit: 17 Feb 2022
Posts: 18
Own Kudos:
5
Given Kudos: 19
Location: India
GMAT 1: 540 Q35 V29
GMAT 1: 540 Q35 V29
Posts: 18
Kudos: 5
Math: Combinatorics 05 Jan 2017, 18:44
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Circular arrangements having hard time understanding how did you arrive at the formula of dividing n! by n. Can someone please elaborate?

Thanks
Kunal
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,397
Own Kudos:
778,405
 [1]
Given Kudos: 99,987
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,397
Kudos: 778,405
 [1]
Math: Combinatorics 06 Jan 2017, 02:40
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
kuvshah
Circular arrangements having hard time understanding how did you arrive at the formula of dividing n! by n. Can someone please elaborate?

Thanks
Kunal
Show more

The number of arrangements of n distinct objects in a row is given by \(n!\).
The number of arrangements of n distinct objects in a circle is given by \((n-1)!\).

The difference between placement in a row and that in a circle is following: if we shift all object by one position, we will get different arrangement in a row but the same relative arrangement in a circle. So, for the number of circular arrangements of n objects we have:

\(\frac{n!}{n} = (n-1)!\).

Check other Arrangements in a Row and around a Table questions in our Special Questions Directory.
User avatar
kuvshah
User avatar
Joined: 05 Jan 2017
Last visit: 17 Feb 2022
Posts: 18
Own Kudos:
5
Given Kudos: 19
Location: India
GMAT 1: 540 Q35 V29
GMAT 1: 540 Q35 V29
Posts: 18
Kudos: 5
Math: Combinatorics 06 Jan 2017, 17:45
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks for the reply. I got it now. I understood this from a youtube videos - the link I cannot post it yet as I am new to this forum. Since we have n! ways to arrange distinct objects in circle and there are n repeats (if we shift all object by one position, we will get because the same relative arrangement in a circle), the equation is n!/(repeat i.e. n). So n!/n = (n-1)!
User avatar
freedom128
User avatar
Joined: 30 Sep 2017
Last visit: 01 Oct 2020
Posts: 939
Own Kudos:
1,356
Given Kudos: 402
GMAT 1: 720 Q49 V40
GPA: 3.8
Products:
My Reviews
GMAT 1: 720 Q49 V40
Posts: 939
Kudos: 1,356
Math: Combinatorics 08 Aug 2019, 13:48
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks for the information....much appreciated!!

Posted from my mobile device
avatar
imants12
avatar
Current Student
Joined: 19 Jul 2019
Last visit: 17 Sep 2025
Posts: 16
Own Kudos:
6
Given Kudos: 93
Location: India
Schools: ISB '23 (A$)
GMAT 1: 710 Q47 V41
GPA: 3.84
Schools: ISB '23 (A$)
GMAT 1: 710 Q47 V41
Posts: 16
Kudos: 6
Math: Combinatorics 03 May 2021, 10:13
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thanks for a wonderful post...!!
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 38,591
Own Kudos:
1,079
Posts: 38,591
Kudos: 1,079
Math: Combinatorics 23 May 2025, 19:31
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
   1   2 
Moderator:
Bunuel
Math Expert
105394 posts