Combination is a way of choosing items from a set, (unlike permutations) when the order of selection doesn’t matter. In smaller cases, it’s possible to count the number of combinations. Combination refers to the mixture of n things taken k at a time without repetition.
Example: For set S = {a, b, c}, the possible combinations of choosing 2 elements are, {a, b}, {a, c}, {b, c}. If we choose 3 items, then there is only one combination {a, b, c} which is we pick all three.
Some other examples of Combination in Real-Life are:
- Team Selection: Choosing 5 players from a pool of 12 for a sports team.
- Menu Selection: Picking a combination of dishes (starter, main course, dessert) from a menu.
- Lottery Numbers: Selecting a set of lottery numbers where the order doesn’t matter.
Combinations Formula
Combination is the choice of selecting r things from a group of n things without replacement and where the order of selection is not important. The number of combinations when ‘r’ elements are selected out of a complete set of ‘n’ elements is denoted by nCr

Example: Let n = 4 (E, F, G, H) and r = 2 (consisting of all the combinations of size 2).
nCr = 4C2
⇒ 4C2 = 4!/((4-2)!×2!)
⇒ 4C2 = (4 × 3 × 2 × 1)/(2 × 1 × 2 × 1) = 6
The six combinations are EF, EG, EH, FG, FH, and GH.
Read More about Combinations Formula.
Relationship between Permutation and Combination
Permutation and combination have a lot of similarities but they also have some striking differences. For n different objects, we have to make r unique selections from this group of n objects.
The number of permutations of size r from n object is nPr here the order, of selection is not important so each selection is counted r! times. So the number of unique selections is nPr / r! We know that a unique selection of r things from the total of n things is called a combination (nCr). Thus,
nCr = nPr / r!
Read More about Principle of Couting.
Difference Between Permutation and Combination
The key difference between Permutation and Combination is:
- Permutation considers the order of arrangement, meaning the arrangement of items matters. For example, arranging letters to form words or seating people in a row.
- Combination ignores the order, meaning only the selection of items matters, not their arrangement. For example, selecting a committee from a pool of candidates or choosing lottery numbers.
Read detailed difference between Permutation and Combination.
How to Calculate Probability of Combinations?
Probability of Combinations can be easily understood with the help of the examples given below:
Example:
- How many ways are possible to distribute 7 different candies to 3 people where each gets only 1 candy?
- In how many ways can the letters of the word ‘POWER’ be arranged?
- How many six-digit numbers can be formed with digits 2,3,5, 6, 7, and 9 and with distinct digits?
Solution:
For 1:
For the first people, we can choose any of the candy among the 7 candies available. Similarly, for the 2nd person we are left with 6 choices and for the 3rd, we will be having 5 choices.
So, the number of ways of distributing candies = 7 × 6 × 5 = 210 ways
For 2:
Letters of the word ‘POWER’ can be arranged in 5! ways i.e.
5 × 4 × 3 × 2 × 1 ways = 120 ways.
For 3:
Number of distinct ways of forming 6-digit numbers with different digits is
6! = 6 × 5 × 4 × 3 × 2 × 1 ways
= 720 ways.
Also, to learn about probability and combinations, read: How To Calculate Probability using Combination?
What is Handshaking Problem?
Handshaking problem is one of the most interesting problem related to combinations. It is used to find that in a room full of people how many handshakes are required for everybody to shake everybody else’s hand exactly once?
Example: The table given below tells us about the minimum number of handshakes required for various groups of people.
| Number of People | Possible Combinations | Minimum Handshake required |
|---|
| Two People | A-B | 1 handshake |
| Three People | A-B
A-C
B-C
| 3 handshake |
| Four People | A-B
A-C
A-D
B-C
B-D
C-D
| 6 handshake |
When there are few people, handshakes can be counted individually. However, with thousands of people in a hall, counting each handshake becomes impractical, which is where combinations come into play.
Handshaking Combination
It means the total number of people in a room doing the handshake with each other. With the help of combination formulas, it can easily be calculated. The formula for calculating the handshakes when there are n people available is given by,
- Total Number of Handshakes = n × (n – 1)/2
- Total Number of Handshakes = nC2
Article Related to Combinations
Examples on Combinations
Example 1: In how many ways 6 boys can be arranged in a queue such that
a) Two particular boys of them are always together
b) Two particular boys of them are never together
Solution:
a) If two boys are always together, then they will be treated as one entity. Hence we can be arranged 5 boys in 5! ways. Also, two boys can arrange themselves in 2 different ways.
Therefore required arrangement = 5! × 2 = 120 × 2 = 240 ways.
b) Total number of permutations among 6 numbers is given by = 6! = 720.
In 240 cases 2 boys are always together.
Thus, for two boys who are never together no of ways will be = 720 – 240 = 480 ways.
Example 2: In a room of n people, how many handshakes are possible?
Solution:
To see the people present, and consider one person at a time. The first person will shake hands with n – 1 other people. The next person will shake hands with n-2 other people, not counting the first person again. Following this, it will give us a total number of
(n – 1) + (n – 2) + … + 2 + 1
= n(n – 1)/ 2 handshakes.
Example 3: Another popular handshake problem starts out similarly with n>1 people at a party. Not being possible to shake hands with yourself, and not counting several times handshakes with the same person, the problem is to show that there will always present two people at the party, who had shaken hands the same number of times in the party.
Solution:
Solution to this problem starts by using Dirichlet’s box principle. If there exists a person at the party, who has shaken hands zero times, then every person which is there at the party has shaken hands with at most n-2 other people at the party.
There are n-1 possible handshakes (from 0 to n-2), among n people there must be two who have shaken hands the same number of times. If there are zero persons, who has shaken hands zero times this means that all of the party guests have shaken hands at least once.
This also amounts to n-1 possible handshakes (from 1 to n-1).
Example 4: In the function, if every person shakes hands with every other in the party and there exists a total of 28 handshakes at the party, find the number of persons who were present in the function.
Solution:
Suppose there are n persons present at a party and every person shakes hands with every other person.
Then, total number of handshakes = nC2 = n(n – 1)/2
⇒ n(n – 1)/2 = 28
⇒ n(n – 1) = 28 × 2
⇒ n(n – 1) = 56
⇒ n = 8
Combinations in Class 11
In Class 11 mathematics, combinations are typically introduced as a fundamental concept in the chapter on Permutations and Combinations.
Also Check:
Practice Questions on Combinations in Maths
Q1. A classroom has 20 students, and a committee of 4 students needs to be formed to organize an upcoming event. In how many ways can this committee be chosen?
Q2. You have 5 different books on mathematics and want to select 3 to place on your desk for quick reference. In how many ways can you choose which 3 books to place on the desk?
Q3. A fruit shop offers baskets that can contain any combination of 3 different fruits from their selection of 5 different fruits (apple, banana, cherry, date, and elderberry). How many different fruit baskets can be made?
Q4. A lottery game requires you to choose 6 numbers out of a possible 49. How many different combinations of numbers can you choose?
Q5. From a pool of 12 jurors, a jury of 6 needs to be selected for a trial. In how many different ways can the jury be formed?
Combinations – FAQs
What is a Combination?
Combination is a way of arranging r different things out of n things for which the order of selection is not important.
How to Solve Combinations?
Combinations help us to calculate the total outcomes of an event when the order of outcomes does not matter. Combinations can be calculated with the formula,
nCr = n! / r! × (n – r)!
What is the Value of nCn?
Value of nCn is calculated as,
nCn = n! / (n-n)!×n! (0! = 1)
= n! / n! = 1
When do we use Combination and Permutation?
Permutation formulas are used when the order of selection matters and Combination formulas are used when the order of the permutation doesn’t matter.
Combination formula is given as,
nCr = n!/r!(n-r)!
What do you mean by Derangement?
When we shuffle the elements of a set so that no element appears in its original position it is called derangement of data.
Can repetitions occur in combinations?
Combinations usually involve distinct choices, but variations like combinations with repetition cater to scenarios where duplicates are allowed, such as selecting toppings for a pizza.
When are combinations useful?
Combinations are handy for scenarios like team formation, menu selection, or jury assembly, where the order of selection isn’t significant but the choice of items is.
How do combinations differ from permutations?
Combinations disregard order, while permutations consider it, impacting scenarios like choosing committee members (combination) versus arranging a sequence (permutation).
Similar Reads
CBSE Class 11 Maths Notes
CBSE Class 11 Maths Revision Notes have been designed in the most basic and detailed format possible, covering nearly all domains such as differential calculus, arithmetic, trigonometry, and coordinate geometry. We know how hard it gets when you shift to an altogether new grade where subjects are no
15+ min read
Chapter 1: Sets
Representation of a Set
Imagine a very haphazard world where no categories are divided to memorize and classify things separately, a world like this will be full of chaos and mess, this is why humans prefer to categorize things and classify them to neatly understand and remember them. The same case happens in mathematics,
8 min read
Types Of Sets
A well-defined collection of Objects or items or data is known as a set. The objects or data are known as the element. For Example, the boys in a classroom can be put in one set, all integers from 1 to 100 can become one set, and all prime numbers can be called an Infinite set. The symbol used for s
9 min read
Universal Sets
Universal Set is a set that has all the elements associated with a given set, without any repetition. Suppose we have two sets P = {1, 3, 5} and Q = {2, 4, 6} then the universal set of P and Q is U = {1, 2, 3, 4, 5, 6}. We generally use U to denote universal sets. Universal Set is a type of set that
6 min read
Venn Diagram
Venn Diagrams are used for the visual representation of relationships as they provide a clear, visual method for showing how different sets intersect, overlap, or remain distinct. They are essential tools in mathematics and logic for illustrating the relationships between sets. By employing intersec
15 min read
Operations on Sets
Sets are fundamental in mathematics and are collections of distinct objects, considered as a whole. In this article, we will explore the basic operations you can perform on sets, such as union, intersection, difference, and complement. These operations help us understand how sets interact with each
15+ min read
Union of Sets
Union of two sets means finding a set containing all the values in both sets. It is denoted using the symbol 'âª' and is read as the union. Example 1:If A = {1, 3. 5. 7} and B = {1, 2, 3} then AâªB is read as A union B and its value is,AâªB = {1, 2, 3, 5, 7} Example 2:If A = {1, 3. 5.7} and B = {2, 4}
13 min read
Chapter 2: Relations & Functions
Cartesian Product of Sets
'Product' mathematically signifies the result obtained when two or more values are multiplied together. For example, 45 is the product of 9 and 5. One must be familiar with the basic operations on sets like Union and Intersection, which are performed on 2 or more sets. Cartesian Product is also one
7 min read
Relation and Function
In mathematics, we often deal with sets of numbers or objects and the ways they are connected to each other. Two important concepts that help us describe these connections are relations and functions. A relation is simply a connection between two sets of objects. Think of it as a rule that pairs ele
3 min read
Domain and Range of Relations
For any two non-empty sets A and B, we define the relation R as the subset of the Cartesian product of A Ã B where each member of set A is related to the member of set B through some unique rule. We defined relation as, R = {(x,y): x â A and y â B} Example: The relation R = {(1,1), (2,4), (3,9)} and
6 min read
Piecewise Function
Piecewise Function is a function that behaves differently for two types of input. As we know a function is a mathematical object which associates each input with exactly one output. For example: If a function takes on any input and gives the output as 3. It can be represented mathematically as f(x)
11 min read
Range of a Function
Functions in math can be thought of as vending machines. Given the money in the form of input, they give some cans or cookies in return. Similarly, functions take some input numbers and give us some output. It can be said that, in real life, Everything can be formulated and solved with the help of f
7 min read
Chapter 3: Trigonometric Functions
Chapter 4: Principle of Mathematical Induction
Chapter 5: Complex Numbers and Quadratic Equations
Complex Numbers
Complex numbers are an essential concept in mathematics, extending the idea of numbers to include solutions for equations that don't have real solutions. Complex numbers have applications in many scientific research, signal processing, electromagnetism, fluid dynamics, quantum mechanics, and vibrati
12 min read
Algebra of Real Functions
The algebra of real functions refers to the study and application of algebraic operations on functions that map real numbers to real numbers. A function can be thought of as a rule or set of rules which map an input to an output knows as its image. It is represented as x ⢠Function ⢠y. A real funct
5 min read
Algebraic Operations on Complex Numbers
A complex number is a number that includes both a real and an imaginary part. It is written in the form: z = a + bi Where: a is the real part,b is the imaginary part,i is the imaginary unit, satisfying i2 = â1. Algebraic operations on complex numbers follow specific rules based on their real and ima
8 min read
Polar Representation of Complex Numbers
Complex numbers, which take the form z = x + yi, can also be represented in a way that highlights their geometric properties. This alternative representation is known as the polar form. The polar representation of a complex number expresses it in terms of its magnitude (modulus) and direction (argum
10 min read
Absolute Value of a Complex Number
The absolute value (also called the modulus) of a complex number z = a + bi is its distance from the origin in the complex plane. It is denoted as â£z⣠and is given by the formula: [Tex]|z| = \sqrt{ (a2 + b2)}[/Tex] Where: a is the real part of z,b is the imaginary part of z,The square root operation
7 min read
Conjugate of Complex Numbers
Conjugate of Complex Number is a complex number obtained by changing the sign of the imaginary part. In simple words, conjugate of a complex number is a number that has the same real part as the original complex number, and the imaginary part has the same magnitude but opposite sign. In the world of
6 min read
Imaginary Numbers
Imaginary numbers are numbers as the name suggests are the number that is not real numbers. All the numbers real and imaginary come under the categories of complex numbers. Imaginary numbers are very useful in solving quadratic equations and other equations whose solutions can not easily be found us
9 min read
Chapter 6: Linear Inequalities
Compound Inequalities
Compound Inequalities are the combination of two or more inequalities. These inequalities are combined using two conditions that are AND, and OR. These conditions have specific meanings and they are solved differently. The inequities in compound inequalities are individually solved using normal rule
11 min read
Algebraic Solutions of Linear Inequalities in One Variable and their Graphical Representation - Linear Inequalities | Class 11 Maths
A linear inequality is a mathematical expression involving an inequality symbol (<, >, â¤, or â¥) and a linear expression. Unlike linear equations, which give a specific solution, linear inequalities define a range of possible solutions. Example: 2x+3>5 In this case, the inequality indicates
7 min read
Graphical Solution of Linear Inequalities in Two Variables
We know how to formulate equations of different degree, and it is used a lot in real life, but the question arises, is it always possible to convert a situation into an equation? Sometimes we get statements like, the number of Covid cases per day in Delhi has reached more than 10,000. This phrase âL
8 min read
Solving Linear Inequalities Word Problems
We are well versed with equations in multiple variables. Linear Equations represent a point in a single dimension, a line in a two-dimensional, and a plane in a three-dimensional world. Solutions to linear inequalities represent a region of the Cartesian plane. It becomes essential for us to know ho
11 min read
Chapter 7: Permutations and Combinations
Fundamental Principle of Counting
Fundamental Principle of Counting is the basic principle that helps us to count large numbers in a non-tedious way. Suppose we have to guess the pin of a three-digit code so the number of ways we can guess is 1000 this can be seen as the pin can be, 000, 001, 002, ....., 999 any number between 000,
11 min read
Permutation
In Mathematics, Permutation is defined as a mathematical concept that determines the number of possible arrangements for a specific set of elements. therefore, it plays a big role in computer science, cryptography, and operations research. For example, take a set {1, 2, 3}. All Permutations taking a
15+ min read
Combinations
Combination is a way of choosing items from a set, (unlike permutations) when the order of selection doesn't matter. In smaller cases, it's possible to count the number of combinations. Combination refers to the mixture of n things taken k at a time without repetition. Example: For set S = {a, b, c}
9 min read
Chapter 8: Binomial Theorem
Chapter 9: Sequences and Series
Sequences and Series
A sequence is an ordered list of numbers following a specific rule. Each number in a sequence is called a "term." The order in which terms are arranged is crucial, as each term has a specific position, often denoted as anâ, where n indicates the position in the sequence. For example: 2, 5, 8, 11, 14
7 min read
General and Middle Terms - Binomial Theorem - Class 11 Maths
Binomial theorem or expansion describes the algebraic expansion of powers of a binomial. According to this theorem, it is possible to expand the polynomial "(a + b)n" into a sum involving terms of the form "axzyc", the exponents z and c are non-negative integers where z + c = n, and the coefficient
7 min read
Arithmetic Series
An arithmetic series is the sum of the terms of an arithmetic sequence, where an arithmetic sequence is a sequence of numbers in which the difference between consecutive terms is constant. Or we can say that an arithmetic progression can be defined as a sequence of numbers in which for every pair of
5 min read
Arithmetic Sequence
An arithmetic sequence or progression is defined as a sequence of numbers in which the difference between one term and the next term remains constant. For example: the given below sequence has a common difference of 1. 1 2 3 4 5 . . . n â â â â â . . . 1st 2nd 3rd 4th 5th . . . nth Terms The Arithme
8 min read
Geometric Progression or GP
Geometric Progression (GP) is a sequence of numbers where each term after the first is found by multiplying the previous term by a constant called the common ratio. Natural Examples of GPPowers of a Number : For example powers of 2: 1, 2, 4, 8, 16, 21, .... form a GP with common ratio 2 All Same Num
12 min read
Geometric Series
In a Geometric Series, every next term is the multiplication of its Previous term by a certain constant, and depending upon the value of the constant, the Series may increase or decrease. Geometric Sequence is given as: a, ar, ar2, ar3, ar4,..... {Infinite Sequence}a, ar, ar2, ar3, ar4, ....... arn
3 min read
Arithmetic Progression and Geometric Progression
Arithmetic Progression and Geometric Progression: The word "sequence" in English means a collection of some numbers or objects in such a way that it has a first member, a second member, and so on. Sequences can be of anything, for example. - January, February, .... is the sequence of months in a yea
11 min read
Special Series in Maths - Sequences and Series | Class 11 Maths
Special Series: A series can be defined as the sum of all the numbers of the given sequence. The sequences are finite as well as infinite. In the same way, the series can also be finite or infinite. For example, consider a sequence as 1, 3, 5, 7, ⦠Then the series of these terms will be 1 + 3 + 5 +
10 min read