Last visit was: 09 Jun 2026, 21:54 It is currently 09 Jun 2026, 21:54
Home
Messages
MBA Fair
Tests
Schools
Events
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   
User avatar
walker
User avatar
Joined: 17 Nov 2007
Last visit: 25 May 2025
Posts: 2,396
Own Kudos:
10,883
 [484]
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,396
Kudos: 10,883
 [484]
Math: Combinatorics Updated on: 03 May 2024, 18:46
Originally posted by walker on 27 Nov 2009, 11:05.
Last edited by bb on 03 May 2024, 18:46, edited 3 times in total.
Practice Questions added
100
Kudos
Add Kudos
383
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
N
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 100% (00:00) wrong based on 4 sessions

History

Date
Time
Result
Not Attempted Yet
COMBINATORICS

created by: walker
edited by: bb, Bunuel


Definition

Combinatorics is the branch of mathematics studying the enumeration, combination, and permutation of sets of elements and the mathematical relations that characterize their properties.


Enumeration

Enumeration is a method of counting all possible ways to arrange elements. Although it is the simplest method, it is often the fastest method to solve hard GMAT problems and is a pivotal principle for any other combinatorial method. In fact, combination and permutation is shortcuts for enumeration. The main idea of enumeration is writing down all possible ways and then count them. Let's consider a few examples:

Example #1
Q:. There are three marbles: 1 blue, 1 gray and 1 green. In how many ways is it possible to arrange marbles in a row?
Solution: Let's write out all possible ways:

Answer is 6.

In general, the number of ways to arrange n different objects in a row

Example #2
Q:. There are three marbles: 1 blue, 1 gray and 1 green. In how many ways is it possible to arrange marbles in a row if blue and green marbles have to be next to each other?
Solution: Let's write out all possible ways to arrange marbles in a row and then find only arrangements that satisfy question's condition:

Answer is 4.

Example #3
Q:. There are three marbles: 1 blue, 1 gray and 1 green. In how many ways is it possible to arrange marbles in a row if gray marble have to be left to blue marble?
Solution: Let's write out all possible ways to arrange marbles in a row and then find only arrangements that satisfy question's condition:

Answer is 3.


Arrangements of n different objects

Enumeration is a great way to count a small number of arrangements. But when the total number of arrangements is large, enumeration can't be very useful, especially taking into account GMAT time restriction. Fortunately, there are some methods that can speed up counting of all arrangements.

The number of arrangements of n different objects in a row is a typical problem that can be solve this way:

1. How many objects we can put at 1st place? n.
2. How many objects we can put at 2nd place? n - 1. We can't put the object that already placed at 1st place.
.....
n. How nany objects we can put at n-th place? 1. Only one object remains.

Therefore, the total number of arrangements of n different objects in a row is

\(N = n*(n-1)*(n-2)....2*1 = n!\)


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\)


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




Practice Questions

Easy:
Medium:
Hard:
­

Show SpoilerImages
Attachment:
Math_Combinatorics_6balls.png
Math_Combinatorics_6balls.png [ 28.14 KiB | Viewed 312607 times ]
Attachment:
Math_Combinatorics_6balls_b.png
Math_Combinatorics_6balls_b.png [ 41.17 KiB | Viewed 312559 times ]
Attachment:
Math_Combinatorics_6balls_l.png
Math_Combinatorics_6balls_l.png [ 43.99 KiB | Viewed 312432 times ]
Attachment:
Math_Comb_Round_t.png
Math_Comb_Round_t.png [ 17.02 KiB | Viewed 310130 times ]
­
Most Helpful Reply
User avatar
shrouded1
User avatar
Retired Moderator
Joined: 02 Sep 2010
Last visit: 29 Apr 2018
Posts: 608
Own Kudos:
3,242
 [197]
Given Kudos: 25
Location: London
Products:
My Reviews
Posts: 608
Kudos: 3,242
 [197]
Math: Combinatorics 20 Sep 2010, 11:22
83
Kudos
Add Kudos
113
Bookmarks
Bookmark this Post
walker

You can post here any concepts/examples you think aren't covered by my post. At least everyone who read this thread will see them. I will do my best to include them in the first post.
Show more

Here are some notes on choosing subsets, which might serve as a good addition. Hope you find this useful.

Choosing subsets & their applications

Combinatorial questions almost always deal with counting certain kinds of subsets of a given set in question. For instance, the popular C(n,r) formula is used to count the number of ways to pick up r objects from a set of n objects. This is basically the same as asking the question : "If a set A contains n objects, how many subsets of A contain exactly r objects ?". Notice that we cannot use P(n,r) to count these subsets since that involves counting the ordering as well, which is irrelevant when it comes to sets ({1,2,3} is same as {3,2,1}).

An interesting and useful extension of this way of thinking about counting presents itself when we encounter a group of problems where we need to count all the possible subsets of a set. Consider the following question :

There is a basket with 5 different fruits inside. A child is given the basket and he may pick out none, one or more of the fruits. In how many ways can this choice be made ?

In this question if we an count all the possible subsets of the basket of fruits, then each subset represents one way of choosing, and hence the answer to the question.

Solution 1
Think of each fruit as a yes/no question that the child is answering. "Will this fruit be picked ?". There are 2 ways to answer that question. There are 5 fruits in all and hence, 5 yes/no questions. Each set of answers [y n y n n], [y y n n n], etc represents a way of picking. In all the number of ways would be 2x2x2x2x2=2^5

Solution 2
An alternate method is to consider the cases, that the child picks 0 fruit, picks 1 fruit, ... picks 5 fruits. And sum the possibility
This method will yield the answer to be C(5,0)+C(5,1)+C(5,2)+C(5,3)+C(5,4)+C(5,5). If you calculate this sum, it is exactly equal to 2^5

Lets now look at a special case where, the objects we are picking from are identical to each other. Consider the following question :

There is a basket with 5 identical balls. A child is given the basket and he may pick out none, one or more of the balls. In how many ways can this choice be made ?

Notice the subtlety in this question, the objects to be picked out are identical to each other. So unlike the previous case where choosing just fruit#1 is a different choice to choosing just fruit#2, here choosing one ball or the other ball constitutes the same choice as long as only 1 ball is picked because the balls are indistinguishable

Solution
Since the balls are identical, the number of ways to pick them is defined merely by the number of balls you pick. So the different ways are "pick 0 balls", "pick 1 ball", ... "pick 5 balls". The answer therefore is 5+1 (The plus 1 giving the case where you pick 0 balls)

Finally we should consider the special case where we need to pick objects out of a set such that a few of the objects are identical to each other.

There 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).

Formula Summary
Number of ways to pick 0 or more objects from n non-identical objects = \(2^n\)
Number of ways to pick 1 or more objects from n non-identical objects = \(2^n - 1\)
Number of ways to pick 0 or more objects from n identical objects = \(n+1\)
Number of ways to pick 1 or more objects from n identical objects = \(n\)
Number of ways to pick 0 or more objects from n objects of which n1 are identical, n2 are identical, ... ,nk are identical, such that n is n1+..+nk = \((n1+1)*(n2+1)*...*(nk+1)\)
Number of ways to pick 1 or more objects from n objects of which n1 are identical, n2 are identical, ... ,nk are identical, such that n is n1+..+nk = \((n1+1)*(n2+1)*...*(nk+1) - 1\)

Typical Applications

Here are just a couple of questions of this type :

How many factors does a number n have ?

Consider the prime factorization of n. Let this be :
\(n=p_1^{a1} p_2^{a2} ... p_n^{an}\)

Any factor of n will be of the form
\(m=p_1^{b1} p_2^{b2} ... p_n^{bn}\) where \(0<=b_i<=a_i\) & \(1<=i<=n\)

To count the number of factors, we need to count all the products of p1,...,pn such that the exponent is less than or equal to ai. This is just case 3. We just count per factor, how many ways to select p1, p2, ....

Answer is (a1+1)*(a2+1)* .... *(an+1)

In a class of 10 students, in how many ways can you form a academic committee, if the committee must contain a minimum of 2 students ?

Total number of ways to form committees (case 1) = 2^10
Number of ways to form of size 0 = 1
Number of ways to form of size 1 = 10 (each student picked one at a time)
So no of ways = 1024 -1 -10 = 1013
General Discussion
User avatar
gmatdelhi
User avatar
Joined: 23 Oct 2009
Last visit: 07 Nov 2011
Posts: 58
Own Kudos:
31
 [4]
Given Kudos: 76
Location: New Delhi, India
Schools:Chicago Booth, Harvard, LBS, INSEAD, Columbia
Posts: 58
Kudos: 31
 [4]
Math: Combinatorics 17 Aug 2010, 06:30
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
Walker,
How come no updates on this chapter? If you're too busy to complete it, could you let me know what additional concepts to add? I could send a draft to you...?!
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.
avatar
santosh18
avatar
Joined: 16 Mar 2010
Last visit: 02 Apr 2012
Posts: 6
Own Kudos:
6
 [2]
Given Kudos: 3
Posts: 6
Kudos: 6
 [2]
Math: Combinatorics 24 Jun 2010, 18:34
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Waiting for the updates..... You hit the nail on the head

"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
avatar
ajay0076
avatar
Joined: 23 Aug 2010
Last visit: 18 Apr 2011
Posts: 1
Own Kudos:
2
 [2]
Posts: 1
Kudos: 2
 [2]
Math: Combinatorics 25 Aug 2010, 11:41
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Hi ,

I am just confused when to use permutation and when to use combination formula while solving problems. i mean what is the basic difference between Permutation and combination.
User avatar
gurpreetsingh
User avatar
Joined: 12 Oct 2009
Last visit: 15 Jun 2019
Posts: 2,266
Own Kudos:
3,976
 [2]
Given Kudos: 235
Status:<strong>Nothing comes easy: neither do I want.</strong>
Location: Malaysia
Concentration: Technology, Entrepreneurship
Schools: ISB '15 (M)
GMAT 1: 670 Q49 V31
GMAT 2: 710 Q50 V35
Products:
My Reviews
Schools: ISB '15 (M)
GMAT 2: 710 Q50 V35
Posts: 2,266
Kudos: 3,976
 [2]
Math: Combinatorics 22 Sep 2010, 14:22
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nice one shrouded.

I actually do the reverse. I use \(P = A^a * B^b * C^c\) for all the combination problems.

eg....for n identical, P is of the form = a*a* .........n times where a is prime number

so number of ways of selecting n identical -> n+1 using the formula of number of divisors.[ (a+1)*(b+1)*(c+1)]

for n non-identical P is of the form = a*b*c*...........n times

so number of ways of selecting n non-identical -> (1+1)*(1+1)...n times using the formula of number of divisors.

= 2^n

similarly if the number of identical balls are given then take \(P = A^a * B^b * C^c\) where a,b,and c are the number of identical balls of type A,B,and C respectively.

Then use the number of divisor formula = \((a+1)*(b+1)*(c+1)\)
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 09 Jun 2026
Posts: 111,171
Own Kudos:
819,806
 [2]
Given Kudos: 106,735
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: 111,171
Kudos: 819,806
 [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
MSoS
User avatar
Joined: 10 Jan 2010
Last visit: 26 Oct 2017
Posts: 108
Own Kudos:
59
 [1]
Given Kudos: 7
Location: Germany
Concentration: Strategy, General Management
Schools: IE '15 (M)
GPA: 3
WE:Consulting (Telecommunications)
Schools: IE '15 (M)
Posts: 108
Kudos: 59
 [1]
Math: Combinatorics 03 Feb 2010, 06:19
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Thank you for the posted information....much appreciated!!
avatar
Himanshiyadavv
avatar
Joined: 24 May 2011
Last visit: 09 Sep 2011
Posts: 3
Own Kudos:
1
 [1]
Posts: 3
Kudos: 1
 [1]
Math: Combinatorics 03 Jun 2011, 09:21
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Kudos ... gr8 work... helped me alot in understanding the conce3pts of combinatorics.. as i m always confused with them... thnks for the notes...
User avatar
SonyGmat
User avatar
Joined: 23 Oct 2011
Last visit: 22 Mar 2012
Posts: 55
Own Kudos:
605
 [1]
Given Kudos: 34
Posts: 55
Kudos: 605
 [1]
Math: Combinatorics 01 Dec 2011, 05:55
Kudos
Add Kudos
1
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

Great Post.

I believe that the formulas can be used only when \(N\geq K\)
User avatar
catty2004
User avatar
Joined: 30 May 2008
Last visit: 01 Nov 2016
Posts: 33
Own Kudos:
997
 [1]
Given Kudos: 26
Posts: 33
Kudos: 997
 [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 :(
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 09 Jun 2026
Posts: 111,171
Own Kudos:
819,806
 [1]
Given Kudos: 106,735
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: 111,171
Kudos: 819,806
 [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
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 09 Jun 2026
Posts: 111,171
Own Kudos:
819,806
 [1]
Given Kudos: 106,735
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: 111,171
Kudos: 819,806
 [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
g4gmat
User avatar
Joined: 15 Dec 2009
Last visit: 05 Dec 2011
Posts: 9
Own Kudos:
23
 [1]
Given Kudos: 14
Concentration: International Business and others
Schools:Any offering one year MBA
WE 1: Information Tech
WE 2: Event Consultant for FIFA addi events and WC
Posts: 9
Kudos: 23
 [1]
Math: Combinatorics 12 Jan 2010, 05:17
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Nice compilation walker... When can we expect the complete material. :-)
User avatar
BarneyStinson
User avatar
Joined: 21 Jul 2009
Last visit: 24 Sep 2010
Posts: 217
Own Kudos:
513
Given Kudos: 22
Concentration: World Domination, Finance, Political Corporatization, Marketing, Strategy
Schools:LBS, INSEAD, IMD, ISB - Anything with just 1 yr program.
Posts: 217
Kudos: 513
Math: Combinatorics 15 Feb 2010, 21:03
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Do it before this April bro!!!! Gotta brush my skills!!!!
User avatar
tarun
User avatar
Joined: 30 Jun 2004
Last visit: 07 Mar 2011
Posts: 102
Own Kudos:
102
Given Kudos: 5
Location: Singapore
Posts: 102
Kudos: 102
Math: Combinatorics 03 Mar 2010, 23:50
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I missed circular arrangement while brushing up my concepts. Thanks for the good post.
User avatar
calvinhobbes
User avatar
Joined: 21 Jan 2010
Last visit: 26 Mar 2013
Posts: 113
Own Kudos:
348
Given Kudos: 38
Schools: Kellogg '15 (S) Wharton '15 (I) CBS '15 (I) Booth '15 (I)
Schools: Kellogg '15 (S) Wharton '15 (I) CBS '15 (I) Booth '15 (I)
Posts: 113
Kudos: 348
Math: Combinatorics 01 Apr 2010, 08:42
Kudos
Add Kudos
Bookmarks
Bookmark this Post
This is very helpful!
avatar
shahed052
avatar
Joined: 31 Jul 2009
Last visit: 27 Jul 2010
Posts: 1
Given Kudos: 1
Affiliations: Bangladesh National Cadet Corps(Army Wing),Dhaka University Film Society
Location: Bangladesh
Concentration: Ms in Finance
Schools:Texas A&amp;M,University of North Florida,University of Texas
GPA: 3.60
Posts: 1
Kudos: 0
Math: Combinatorics 04 Jul 2010, 11:32
Kudos
Add Kudos
Bookmarks
Bookmark this Post
many many thanks for the whole math collection...waiting for update and new one...
User avatar
TallJTinChina
User avatar
Joined: 24 May 2010
Last visit: 28 Jun 2011
Posts: 38
Own Kudos:
149
Given Kudos: 4
Status:Waiting to hear from University of Texas at Austin
Location: Changchun, China
Concentration: MSA - Generalist
Schools:University of Texas at Austin, Michigan State
GPA: 3.9
Posts: 38
Kudos: 149
Math: Combinatorics 14 Jul 2010, 19:35
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Just read this post and the one about probability. A great help! Now I will try some application...
 1   2   
Moderator:
Bunuel
Math Expert
111171 posts