Careers360 Logo
Scan and Download the App!
Search Faster,
Smarter, Better
Rated 4.2
by 1M+ students
Permutation vs Combination: Definition and Formulas

Permutation vs Combination: Definition and Formulas

Edited By Komal Miglani | Updated on Jul 02, 2025 07:31 PM IST

Permutations and combinations are the ways to select certain objects from a group of objects to form subsets with or without replacement. Permutations involve the arranging of objects i.e. to place them in a specific order among themselves. In combinations, we select the object a few objects out of the given objects. In real life, we use permutations for arranging people, digits, colours, and combinations for the selection of menus, food, clothes, and subjects.

Permutation vs Combination: Definition and Formulas
Permutation vs Combination: Definition and Formulas

In this article, we will learn about the difference between Permutations and combinations. This topic falls under the broader category of Permutations and combinations, which is a crucial chapter in Class 11 Mathematics. This is very important not only for board exams but also for competitive exams, which even include the Joint Entrance Examination Main and other entrance exams: SRM Joint Engineering Entrance, BITSAT, WBJEE, and BCECE.

Background wave

Permutation

A permutation is an arrangement of all or part of a set of objects, with regard to the order of the arrangement.

Arranging n objects in r places (Same as arranging n objects taken r at a time) is equivalent to filling r places from n things.

Formula of permutation

The number of ways of arranging n objects taken r at a time =nPr

Combination

The meaning of combination is selection. The notation of selecting r objects from n given object is nCr

Formula of combination

nCr×r!=nPrnCr=nPrr!nCr=n!(nr)!r!

Relation between Permutation and combination

nCr×r!=nPr

Permutations Vs Combinations

Always remember, in an arrangement, the order is always important. Whereas, in Combination, the order is not important.

Consider the following examples-

1. Selecting a team of 11 from 16 players - Selection

Drawing a batting line-up of 11 from 16 players - Arrangement

2. Selecting 3 students out of 10 students who will receive scholarships of the same value - Selection

Selecting 3 students out of 10 students who will receive scholarships of Rs. 500, Rs. 1000 and Rs. 2000 - Arrangement.

Difference Between Permutation and Combination

The difference between the Permutations and combinations is given below.

PermutationsCombinations
Arranging people, digits, numbers, alphabets, letters, and coloursSelection of menu, food, clothes, subjects, team.
Picking a team captain, pitcher and shortstop from a group.Picking three team members from a group.
Picking first, second and third place winners.Picking three winners.
Picking two favourite colours, in order, from a colour brochure.Picking two colours from a colour brochure.

Applications of Permutation and Combination

Some applications of permutation and combinations are given below:

1) Passwords and Security

When you set a password, you select characters from a set of possibilities, such as letters, numbers, and symbols. The more options you have for each character position, the more potential combinations there are for your password.

2) Travel Itineraries and Planning

Planning a vacation often involves looking at all the places you want to visit and figuring out the best sequence to do so, which is a practical application of permutations (if travel time between locations matters) and combinations (if you’re just selecting destinations to visit without a set order).

3) Sports Teams Line-ups

Consider a baseball team manager thinking about the batting order. The sequence in which players bat is crucial and can be determined using permutations because the order matters.

4) Seating Arrangements and Event Planning

A seating plan is a very important element of the planning process regardless of whether you are organizing a theatre performance, a wedding reception, or a conference. Every single individual who is attending the event is directly impacted by how well the seating system works. The number of possibilities created by permutations and combinations makes it easier for the planners to bring each guest to that exact spot where they belong.

5) Fashion and Design

Fashion designers and interior decorators use permutations and combinations to predict trends and create novel designs

Recommended Video Based on Permutations vs Combinations:


Solved Example Based on Permutations Vs Combinations

Example 1: If 2nC3:nC3:10:1,then the ratio (n2+3n):(n23n+4) is : [JEE MAINS 2023]

Solution

2nC3nC3=102n!(n3)!(2n3)!n!=102n(2n1)(2n2)n(n1)(n2)=104(2n1)n2=108n4=10n202n=16n2+3nn23n+4=64+246424+4=8844=2

Hence, the answer is 2: 1

Example 2: The number of different ways in which five ‘alike dashes’ and eight ‘alike dots’ can be arranged, using only seven of these ‘dashes’ & ‘dots’ is

Solution

The number of ways of filling n distinct objects at r places =n(n1)(n2)(nr+1)= =n(n1)(n2)(nr+1)(nr)!(nr)!=n!(nr)!=npr=n.n1pr1

Where rn and r0

7C2+7C3+7C4+7C5+7C6+7C7=278=120

Hence, the answer is 120

Example 3: All the five-digit numbers N=abcde having property a<b<c<d<e are arranged in the increasing order of their magnitude. The 97th  number in the list does not contain the digit:

Solution: All the possible numbers are

9C5 (none containing the digit 0)=126
Total number starting with 1

=8C4=70 (using 2,3,4,5,6,7,8,9)
1_ _ _ _ _

Total numbers starting with 23

=6C3=20 (using 4,5,6,7,8,9)

23 _ _ _ _

Total numbers starting with 245=4C2=6 (using 6,7,8,9)

245 _ _ _

97th  number =24678

Hence, the answer is 5

Example 4: A seven-digit number is in the form of abcdefg ( g,f,e,.. etc. are digits at units, tens, hundred places....etc), where a<b<c<d>e>f>ga,b,c,e,f,g are different digits. The number of such numbers is:

Solution: Case (i): zero not taken
Now we have to select seven digits from 1,2,3,4,5,6,7,8,9 so ways are 9C7
From 7 digits select the largest digits as d and from the remaining 6 , we can select three digits a,b,c in 6C3 ways.
Hence number of such numbers are =9C76C3
Case (ii): zero taken then
0 must be in last place, then the number of such numbers are 9C65C3
9C76C3+9C65C3=9C26C3+9C3C3=1560

Hence, the answer is 1560

Example 5: A 6-digit number is to be formed using the digits 0-9, where repetition is allowed. How many different numbers can be formed if the number must be divisible by 2 and have exactly 3 even digits?

Solution: To calculate the number of different 6-digit numbers that can be formed using the digits 09, where repetition is allowed, and the number must be divisible by 2 with exactly 3 even digits, we can consider the following:

Since the number must be divisible by 2 , the last digit must be even. We have 5 even digits (0,2,4,6,8) to choose from for the last digit.

For the remaining 5 digits, we need to select 2 even digits and 3 odd digits. We have 5 even digits and 5 odd digits to choose
from, so we can select the 2 even digits in C(5,2) ways and the 3 odd digits in C(5,3) ways.
Once we have selected the digits, we can arrange them in the remaining 5 positions in 5 ! ways.
Therefore, the total number of different 6-digit numbers that can be formed with the given conditions is:

C(5,2)×C(5,3)×5!×5=10×10×120×5=60,000

Hence, the answer is 60,000


Frequently Asked Questions (FAQs)

1. Why is 0! defined as 1?
0! is defined as 1 for consistency in mathematical formulas, especially in combinations and permutations. It makes sense conceptually too - there's only one way to arrange zero items. This definition allows formulas like nC0 = n!/(0!(n-0)!) to work correctly for all non-negative integers n.
2. How does the addition of constraints affect permutation and combination problems?
Constraints typically reduce the number of possible outcomes. They often require breaking the problem into cases or using the complementary counting method. For example, if you must include certain items or exclude others, you'll need to adjust your approach accordingly.
3. How do you calculate the number of combinations when order doesn't matter but repetition is allowed?
This scenario uses the formula (n+r-1)Cr, also known as "stars and bars" or "balls and urns" problems. It's different from standard combinations because items can be repeated, leading to more possibilities than nCr.
4. How does the concept of "replacement" affect permutations and combinations?
Replacement means an item can be selected more than once. With replacement, each selection has all options available, increasing the total possibilities. Without replacement, each selection reduces the available options for the next pick. This affects the formulas and calculations for both permutations and combinations.
5. Why is it impossible to have a negative number of permutations or combinations?
Permutations and combinations represent real-world groupings or arrangements. It's impossible to have a negative number of ways to select or arrange items. Mathematically, the formulas always yield non-negative results for valid inputs.
6. Can you have a combination with only one item?
Yes, you can have a combination with one item. This is often called a "1-combination" or "singleton." It's simply choosing one item from a set of options. The number of ways to do this is equal to the number of items in the set.
7. What's the relationship between nCr and nCn-r?
nCr equals nCn-r. This is known as the symmetry property of combinations. It means choosing r items from n is the same as choosing the n-r items not to be included. For example, choosing 2 items from 5 is the same as choosing the 3 items not to be included.
8. Why is nC1 always equal to n?
nC1 represents choosing 1 item from n items. There are n ways to do this - you can choose any one of the n items. Mathematically, nC1 = n!/(1!(n-1)!) = n*((n-1)!)/((n-1)!) = n.
9. What's the relationship between Pascal's triangle and combinations?
Each number in Pascal's triangle is the sum of the two numbers directly above it. These numbers represent combinations: the kth number in the nth row is nCk. This visual representation helps in understanding properties of combinations.
10. How do you approach a problem involving both permutations and combinations?
Break the problem into steps. Identify which parts require order (permutations) and which don't (combinations). Often, you'll multiply the results of these steps. For example, choosing a team (combination) and then selecting positions for them (permutation).
11. What is the fundamental difference between a permutation and a combination?
The key difference is order. In a permutation, the order of selection matters, while in a combination, it doesn't. For example, when choosing a 3-digit code, 123 and 321 are different permutations. But when selecting 3 flavors of ice cream, the order doesn't matter, so it's a combination.
12. Why do we use factorials in permutation and combination formulas?
Factorials are used because they represent the number of ways to arrange items. For n items, n! gives all possible arrangements. In permutations and combinations, we often need to calculate all possible arrangements and then divide out arrangements we don't want, which is why factorials appear in the formulas.
13. Why is the number of combinations always less than or equal to the number of permutations for the same n and r?
Combinations are always fewer or equal because they don't consider order. Each combination can correspond to multiple permutations (all the different orders of the same items). The only time they're equal is when you're choosing all items (n=r) or just one item (r=1).
14. How do you decide whether a problem requires a permutation or a combination?
Ask yourself: "Does the order matter?" If yes, it's a permutation. If not, it's a combination. For example, "How many ways to arrange 5 books on a shelf?" is a permutation. "How many ways to choose 3 books from 5?" is a combination.
15. How does the formula for permutations with repetition differ from permutations without repetition?
For permutations without repetition, we use nPr = n!/(n-r)!. For permutations with repetition, it's simply n^r. This is because with repetition, you have all n choices available for each of the r selections, regardless of previous choices.
16. How does the concept of derangements relate to permutations?
A derangement is a permutation where no element appears in its original position. It's a special type of permutation with additional constraints. The number of derangements is always less than the total number of permutations (n!) for n > 1.
17. How do you approach problems involving permutations or combinations of objects with repeated elements?
For combinations, repeated elements don't change the formula. For permutations, we need to account for the repetitions. If we have n items with n1 of type 1, n2 of type 2, etc., the number of distinct permutations is n!/(n1!*n2!*...). This formula "removes" the redundant permutations caused by repeated elements.
18. How does the concept of permutations apply to circular arrangements?
In circular arrangements, rotations of the same arrangement are considered identical. This reduces the total number of permutations. For n items in a circle, there are (n-1)! permutations, not n!, because we can fix one item's position and permute the rest.
19. What's the difference between a permutation and a variation?
These terms are often used interchangeably, but some texts distinguish them. A variation is sometimes used to refer specifically to permutations where r < n, while permutation is used when r = n. However, this distinction isn't universal, and many sources use permutation for both cases.
20. How do permutations and combinations apply in probability theory?
They're fundamental in calculating probabilities of complex events. Permutations are used when order matters (like in card arrangements), while combinations are used when it doesn't (like in lottery draws). Understanding these concepts is crucial for correctly counting favorable outcomes in probability problems.
21. Why is nC0 always equal to 1?
nC0 represents the number of ways to choose 0 items from n items. There's only one way to do this - by not choosing anything. Mathematically, nC0 = n!/(0!(n-0)!) = n!/(1*n!) = 1.
22. What's the difference between nPn and n!?
There is no difference. nPn and n! are the same thing. Both represent the number of ways to arrange all n items in a set. The formula for nPr when r=n simplifies to n!, showing they're equivalent.
23. Can you have more permutations than the total number of items?
Yes, but only if repetition is allowed. Without repetition, the maximum number of permutations is n! (when r=n). With repetition, you can have n^r permutations, which can exceed n when r > 1.
24. Can you have a combination or permutation where r > n?
For standard combinations and permutations without repetition, r cannot exceed n. It's impossible to choose or arrange more items than you have. However, for permutations with repetition, r can be greater than n, as items can be reused.
25. What's the difference between nCr and the Stirling number of the second kind?
nCr counts subsets of size r from n items. The Stirling number of the second kind counts ways to partition n items into r non-empty subsets. While both involve choosing items, they represent fundamentally different processes.
26. How do permutations and combinations relate to the binomial theorem?
The binomial theorem expands (x+y)^n using combinations. The coefficient of x^k y^(n-k) in the expansion is nCk. This connection shows how combinations are fundamental to algebra and probability theory.
27. How do you calculate the total number of possible combinations for all values of r from 0 to n?
The total is 2^n. This represents all possible subsets of n items, including the empty set and the full set. It can be calculated by summing nC0 + nC1 + ... + nCn, or more simply by recognizing it as the sum of all possible choices (take or don't take) for each item.
28. Why does nCr = nCn-r?
This symmetry occurs because choosing r items from n is equivalent to choosing the n-r items not to be included. For example, selecting 3 items from 5 is the same as selecting the 2 items not to be included. This property is useful in simplifying calculations.
29. Can you explain the concept of "stars and bars" in combination problems?
"Stars and bars" is a technique for solving certain types of combination problems, particularly those involving distributing identical objects into distinct groups. It's used to calculate combinations with repetition allowed. The formula (n+r-1)Cr comes from this concept, where n is the number of types of items and r is the number being distributed.
30. How does the multiplication principle relate to permutations and combinations?
The multiplication principle is the foundation for both permutations and combinations. It states that if one event can happen in m ways, and another independent event can happen in n ways, then the two events can happen together in m*n ways. This principle is why we multiply in permutation and combination calculations.
31. What's the difference between nPr and nCr in terms of their formulas and meanings?
nPr = n!/(n-r)! represents permutations (order matters), while nCr = n!/((n-r)!r!) represents combinations (order doesn't matter). nPr counts ordered selections, while nCr counts unordered selections. nCr is always less than or equal to nPr for the same n and r.
32. How do you calculate the number of ways to distribute n distinct objects into r distinct boxes?
This is a case of partitioning, not simple permutation or combination. The answer is r^n. Each of the n objects has r choices (boxes) to go into, and these choices are independent. This is an application of the multiplication principle.
33. What's the connection between combinations and the coefficients in the binomial expansion?
In the binomial expansion of (x+y)^n, the coefficient of x^k y^(n-k) is nCk. This connection is why these coefficients are called "binomial coefficients." It shows how combinations naturally arise in algebra and provides a method for calculating combinations using Pascal's triangle.
34. How do you approach a problem that asks for the number of ways to arrange n people in a line if certain people must be together?
Treat the group that must be together as a single unit. First, arrange this unit with the other individuals (n - number in group + 1 items to arrange). Then, multiply by the number of ways to arrange the people within the group. This method reduces the problem to a simpler permutation.
35. What's the difference between permutations with and without repetition in terms of their formulas?
Permutations without repetition use the formula nPr = n!/(n-r)!, while permutations with repetition use n^r. The latter allows each selection to use all n options, while the former reduces available options with each selection.
36. How do you calculate the number of ways to select r items from n items if at least one of a specific subset must be chosen?
Use the complementary counting method. Calculate the total ways to choose r from n, then subtract the number of ways to choose r items without any from the specific subset. If there are k items in the subset, this is nCr - (n-k)Cr.
37. What's the relationship between permutations, combinations, and set theory?
Permutations and combinations are ways of selecting or arranging elements from sets. Combinations correspond to subsets in set theory. The total number of subsets of a set with n elements is 2^n, which equals the sum of all nCr for r from 0 to n.
38. How do you approach a problem involving permutations or combinations with multiple constraints?
Break the problem into cases based on the constraints. Solve each case separately, then add the results. Sometimes, it's easier to count the complement (what's not allowed) and subtract from the total. Always check if the principle of inclusion-exclusion is needed for overlapping cases.
39. What's the connection between combinations and Pascal's identity?
Pascal's identity states that nCr = (n-1)C(r-1) + (n-1)Cr. This reflects the process of building larger combinations from smaller ones and is the basis for constructing Pascal's triangle. It shows how each combination can be formed by either including or excluding a specific element.
40. How do permutations and combinations apply in coding theory?
In coding theory, permutations are used to create ciphers and study code transformations. Combinations are used in error-correcting codes, determining the number of possible messages of a given length, and analyzing code efficiency. Both concepts are crucial in understanding the possibilities and limitations of various coding schemes.
41. What's the difference between nCr and the multinomial coefficient?
nCr chooses r items from n without regard to order. The multinomial coefficient (n!/(n1!*n2!*...)) calculates the number of ways to partition n items into groups of sizes n1, n2, etc. It's a generalization of the binomial coefficient to more than two categories.
42. How do you calculate the number of ways to distribute n identical objects into r distinct boxes?
This is a classic "stars and bars" problem. The answer is (n+r-1)Cr. It's equivalent to placing n stars and r-1 bars in a line, which creates r groups (boxes) containing the n objects. This formula is different from distributing distinct objects, which would be r^n.
43. What's the relationship between permutations and the concept of bijective functions?
A permutation of n elements can be viewed as a bijective (one-to-one and onto) function from a set of n elements to itself. The number of such functions is n!, which is why there are n! permutations of n elements. This connection links permutations to fundamental concepts in abstract algebra.
44. How do you approach problems involving circular permutations?
In circular permutations, rotations of the same arrangement are considered identical. For n items, there are (n-1)! circular permutations. This is because we can fix one item's position (reducing the problem to arranging n-1 items) and divide by n to account for the n equivalent rotations of each arrangement.
45. What's the significance of the identity nCr * rCk = nCk * (n-k)C(r-k)?
This identity, sometimes called the multiplication principle for combinations, shows how to break down a selection process into stages. It's useful in solving complex counting problems by relating different combination calculations. It can be proved algebraically or by considering the counting process it represents.
46. How do permutations and combinations relate to the fundamental counting principle?
The fundamental counting principle states that if one event can occur in m ways, and another independent event in n ways, then the two can occur together in m*n ways. This principle underlies the derivation of both permutation and combination formulas, showing how to count complex arrangements by breaking them into simpler steps.
47. What's the difference between combinations with repetition and combinations without repetition?
Combinations without repetition (nCr) select r items from n where each item can be chosen only once. Combinations with repetition ((n+r-1)Cr) allow items to be repeated. The latter always yields a larger or equal number, as it includes all possibilities of the former plus additional combinations with repeated elements.
48. How do you calculate the number of ways to arrange n items in a line if some items are identical?
If there are n items total, with n1 of type 1, n2 of type 2, etc., the number of distinct arrangements is n!/(n1!*n2!*..

Articles

Back to top