EngineeringRise

Counting Principle and Permutations: JEE Main Maths Notes

Reviewed Last updated 2026-11-20. Syllabus topic: Fundamental principle of counting and permutations.

In short. The fundamental principle of counting multiplies the choices for tasks done one after another and adds the choices for alternatives. A permutation is an ordered arrangement: P(n, r) = n!/(n - r)! counts ordered selections of r from n different objects.

  • Tasks done one after another with a ways and b ways give a x b outcomes (multiplication); either-or choices give a + b (addition).
  • P(n, r) = n!/(n - r)! = n(n - 1)...(n - r + 1) counts ordered selections of r objects from n different objects, with no repetition.
  • If repetition is allowed, r places each filled in n ways give n^r outcomes.
  • n objects with p of one kind identical, q of another identical and the rest different can be arranged in n!/(p! q!) ways.
  • In number problems fill the restricted place first (units digit for even or divisible by 5, leading digit for no zero).

Syllabus line: PERMUTATIONS AND COMBINATIONS: The fundamental principle of counting, permutations and combinations; Meaning of P(n, r) and C(n, r). Simple applications. (NTA JEE (Main) 2026 syllabus, Mathematics, Unit 4 (https://jeemain.nta.nic.in/document/syllabus-2026/))

Before you start

Prerequisites

  • Sets, relations and functions (lesson planned): Counting the elements of a set and of a Cartesian product (a choices followed by b choices gives a x b pairs) is the same idea as the multiplication principle. Read this first if ordered pairs are unfamiliar.

Related topics

The concept step by step

  1. Step 1: Counting by building the outcome in stages

    To count outcomes, imagine building each one place by place. If the first stage can be done in m ways and the second in n ways, every first choice pairs with every second choice, so there are m x n outcomes. Example: 3 shirts and 4 trousers give 12 outfits. Extend this to any number of stages by multiplying every count.

  2. Step 2: Alternatives add, stages multiply

    If a job can be done by method one (m ways) or by method two (n ways), and no way belongs to both lists, the total is m + n. Ask yourself whether the choices happen one after another (multiply) or in place of each other (add). Example: 3 bus routes or 2 train routes make 3 + 2 = 5 ways for one leg; if a second leg has 3 ways, the whole trip has 5 x 3 = 15 ways.

  3. Step 3: Factorial and arranging all objects

    Arranging n different objects in a row: the first place has n choices, the next n - 1, and so on down to 1. The product is n! (read n factorial). So 4 different books can be placed in a row in 4! = 24 ways. By convention 0! = 1, which keeps later formulas working when nothing is left to arrange.

  4. Step 4: P(n, r), arranging only some of the objects

    If only r places are to be filled from n different objects, stop the multiplication after r factors: P(n, r) = n x (n - 1) x ... x (n - r + 1) = n!/(n - r)!. For example P(7, 3) = 7 x 6 x 5 = 210. The letter P stands for ordered selection, so the same three objects in a different order count as a different permutation.

  5. Step 5: Repetition allowed, and identical objects

    If every place may reuse any of n objects, the count is n multiplied r times, n^r. If some objects are identical, many arrangements coincide, so divide n! by the factorial of each repeat count. For BANANA, with 3 A and 2 N, the count is 6!/(3! x 2!) = 60, which is far fewer than 6! = 720.

  6. Step 6: Number problems and restricted places

    Digit problems add conditions. A number cannot start with 0, so the leading place has one fewer choice. For even, the units digit must be even; for divisible by 5, the units digit must be 0 or 5. Fill the restricted place first, and if the choice at a later place depends on an earlier one (such as 0 already used), split into cases and add.

Worked examples

Each solution shows the marks every step would earn. The sanity check tests units and size of the answer.

Example 1 (easy)

Between towns A and B there are 3 bus routes and 2 train routes. Between towns B and C there are 3 bus routes only. In how many ways can a person travel from A to C by going through B?

Marks-style solution of example 1
StepMarks
Alternatives add: A to B can be done in 3 + 2 = 5 ways.1
The two legs are done one after the other, so multiply: 5 x 3.2
Number of ways = 15.1
Total: 4 marks4

Answer: 15

Fast method: Add within a leg, multiply across legs: (3 + 2) x 3 = 15.

Sanity check: The count is a whole number and lies between 5 (one leg fixed) and 5 x 3 = 15 (all combinations); there is no way to exceed the full product.

Example 2 (easy)

Find P(7, 3).

Marks-style solution of example 2
StepMarks
P(7, 3) is the number of ordered selections of 3 different objects from 7.1
First place 7 ways, second 6 ways, third 5 ways.1
P(7, 3) = 7 x 6 x 5 = 210.1
Total: 3 marks3

Answer: 210

Fast method: Write 3 factors starting from 7 going down: 7 x 6 x 5.

Sanity check: P(7, 3) must be below 7³ = 343 (repetition allowed) and above C(7, 3) = 35 (order ignored); 210 = 35 x 3! fits.

Example 3 (medium)

How many 3-digit numbers can be formed using the digits 0, 1, 2, 3 and 4 if digits may be repeated?

Marks-style solution of example 3
StepMarks
The hundreds digit cannot be 0, so it has 4 choices (1, 2, 3, 4).1
The tens and units digits can each be any of the 5 digits, repetition allowed.1
Count = 4 x 5 x 5 = 100.1
Total: 3 marks3

Answer: 100

Fast method: Leading digit 4 ways, others 5 each: 4 x 5 x 5.

Sanity check: The unrestricted count is 125; the 25 strings that begin with 0 (1 x 5 x 5) are removed, leaving 100.

Typical trap: Writing 5 x 5 x 5 = 125 counts strings such as 042, which is not a 3-digit number. The leading place must exclude 0.

Example 4 (medium)

How many different arrangements of all the letters of the word BANANA are there?

Marks-style solution of example 4
StepMarks
BANANA has 6 letters: B once, A three times, N twice.1
If all were different there would be 6! = 720 arrangements.1
Divide by 3! for the A and by 2! for the N: 720/(6 x 2) = 60.2
Total: 4 marks4

Answer: 60

Fast method: 6!/(3! x 2!) = 60.

Sanity check: The answer must divide 720 exactly and be much smaller than 720; 720/12 = 60.

Typical trap: Answering 6! = 720 treats the three As and the two Ns as different. The identical letters make many arrangements the same word.

Example 5 (hard, multi-step)

How many 5-digit numbers divisible by 5 can be formed using the digits 0, 1, 2, 3, 4 and 5, with no digit repeated?

Marks-style solution of example 5
StepMarks
Divisible by 5 means the units digit is 0 or 5; split into these two cases.1
Units digit 0: the other four places use the remaining 5 digits in order, 5 x 4 x 3 x 2 = 120.2
Units digit 5: the leading digit cannot be 0 or 5, so 4 choices; then 4, 3, 2 choices for the next three places (0 is now allowed): 4 x 4 x 3 x 2 = 96.3
Total = 120 + 96 = 216.1
Total: 7 marks7

Answer: 216

Fast method: Case on the units digit (0 or 5), handle the leading digit in the 5 case, then add.

Sanity check: There are 5 x 5 x 4 x 3 x 2 = 600 five-digit numbers with distinct digits from this set; about 2 in 6 end in 0 or 5, so around 200 is expected, and 216 fits.

Example 6 (hard, multi-step)

The digits 1, 2, 2, 3, 3, 3 are each used exactly once to write a 6-digit number. How many such numbers are even?

Marks-style solution of example 6
StepMarks
A number is even only if its last digit is even, and the only even digit is 2, so the units digit is 2.1
The remaining digits are 1, 2, 3, 3, 3 to be placed in the other five places.1
These can be arranged in 5!/3! = 20 ways (the three 3s are identical).2
Number of even numbers = 20.1
Total: 5 marks5

Answer: 20

Fast method: Fix the last digit as 2, then 5!/3! for the remaining digits.

Sanity check: All such numbers number 6!/(2! x 3!) = 60; by symmetry the last place is a 2 in 2 of every 6 cases (two of the six digits are 2), giving 60 x 2/6 = 20.

Typical trap: Treating the two 2s as different and fixing "a 2" at the end gives 2 x 5!/3! = 40, which counts every number twice.

Formulas and units

Formula and unit box for Fundamental principle of counting and permutations
ResultFormulaValid whenUnits or noteWorked example
Multiplication principlem ways then n ways: m x nstages done one after another, choices independentdimensionlessExample 1
Addition principlem ways or n ways (no overlap): m + nalternatives that cannot happen togetherdimensionlessExample 1
Factorialn! = n(n - 1)...2 x 1, with 0! = 1n a non-negative integerdimensionlessExample 4
PermutationsP(n, r) = n!/(n - r)! = n(n - 1)...(n - r + 1)r different objects from n different, order matters, no repeatsdimensionlessExample 2
Special casesP(n, 0) = 1, P(n, 1) = n, P(n, n) = n!n a non-negative integerdimensionlessnone
RecurrenceP(n, r) = n x P(n - 1, r - 1)integers n >= r >= 1dimensionlessnone
Repetition allowedr places, n choices each: n^rr places each filled from n choices, repetition alloweddimensionlessExample 3
Identical objectsn!/(p! q! r!) for p, q, r identical of three kindsp, q, r identical of three kinds, rest different, n in totaldimensionlessExample 4
Digit ruleleading digit nonzero; even: units in 0, 2, 4, 6, 8; by 5: units in 0, 5forming numbers with digit restrictionsdimensionlessExample 3

Use your browser's print command to print this page; the formula box prints on its own page. Download the one-page formula sheet (PDF).

Common mistakes and speed

  • Adding where the stages happen one after another, or multiplying where the cases are alternatives. Why it tempts: Both operations give a tidy number, and the words "and" and "or" are easy to mix up when the problem is long.
  • Letting 0 stand at the front of a number. Why it tempts: The unrestricted product (for example 5 x 5 x 5) looks complete and appears as an answer option.
  • Treating identical letters or digits as different, giving n! for BANANA-type problems. Why it tempts: The factorial formula is the first one remembered and the repeats are easy to overlook.
  • Using P(n, r) = n!/r! or n!/(n + r)!. Why it tempts: The factorial denominator is half-remembered, and a wrong denominator still gives an integer.
  • Using P(n, r) when order does not matter, or n^r when repetition is not allowed. Why it tempts: The question wording ("form", "select", "make") hides whether the order and repetition rules apply.

Time per question and fast method

Target: about 75 seconds per question.

Decide the places, mark any restricted place, fill that one first, then multiply. For identical objects divide by the factorials of the repeat counts. For counting some letters of a word with repeats, list the repeat patterns and add the cases rather than hunting for a single formula.

Recall quiz

Pick an option for each question. Your answers stay on this page and are not sent anywhere.

Question 1. The value of P(9, 2) is
Show the answer

Answer: A: 72. P(9, 2) = 9 x 8 = 72, the number of ordered selections of 2 from 9 different objects.

Question 2. How many 3-letter strings can be made from the letters A, B, C, D, E if letters may be repeated?
Show the answer

Answer: B: 125. Each of the 3 places has 5 choices when repetition is allowed, so 5 x 5 x 5 = 125.

Question 3. The number of distinct arrangements of the letters of the word LEVEL is
Show the answer

Answer: C: 30. LEVEL has 5 letters with L twice and E twice, so 5!/(2! x 2!) = 120/4 = 30.

Question 4. How many 2-digit numbers (10 to 99) have two different digits?
Show the answer

Answer: D: 81. The tens digit has 9 choices (1 to 9) and the units digit any of the 9 digits different from it (0 is allowed), so 9 x 9 = 81.

Question 5. The value of 5!/3! is
Show the answer

Answer: A: 20. 5!/3! = 5 x 4 = 20, because the common factor 3! cancels; this equals P(5, 2).

Practice

Test your answers nowFull-length mocks

Previous-year questions

Previous-year questions are not imported yet. Previous-year questions are not imported yet; see the official papers on the NTA site. Official NTA papers page.

Going deeper and revision

Fundamental principle of counting: multiply and add

If one task can be done in m ways and, for each of these, a second task can be done in n ways, the two tasks done in order can be completed in m x n ways (multiplication principle). It extends to any number of stages, and the number of choices at a later stage may depend on the earlier ones as long as the count at each stage is fixed. If a job can be done either by one method in m ways or by another method in n ways, and no way is common to both, there are m + n ways in all (addition principle). The usual test is the word "and" (do this and then that: multiply) versus "or" (do this or that instead: add). Before multiplying, check that the stages are really independent in count; before adding, check that the cases are mutually exclusive and cover everything. Counts are pure numbers: they carry no units, and the answer must be a non-negative integer.

Factorial, permutations and the meaning of P(n, r)

The factorial n! = n x (n - 1) x ... x 2 x 1 is the number of ways to arrange n different objects in a row, and 0! = 1 by convention so that formulas still work at the boundary. A permutation of r objects chosen from n different objects is an ordered arrangement of r of them. Filling r places in order, the first place has n choices, the second n - 1, and so on, so P(n, r) = n(n - 1)(n - 2)...(n - r + 1) = n!/(n - r)!. Special cases: P(n, 0) = 1, P(n, 1) = n, P(n, n) = n!. Also P(n, r) = n x P(n - 1, r - 1), which is the same argument with the first place peeled off. The symbol needs r at most n; for r larger than n there is no arrangement and the count is 0. P(n, r) counts ordered selections, so the same set of objects in a different order counts again.

Repetition allowed and identical objects

When each place can reuse any of the n objects, every place has n choices and r places give n^r outcomes (for example 3-digit codes from digits 0 to 9 with repetition allowed: 10³ = 1000). When some objects are identical, swapping them changes nothing, so the n! arrangements of "labelled" objects over-count. If among n objects p are alike of one kind, q alike of a second kind and r alike of a third, the number of distinct arrangements of all n is n!/(p! q! r!). The word BANANA has 6 letters with 3 A, 2 N and 1 B, so 6!/(3! 2!) = 60. To arrange only some of the letters of a word with repeats you cannot use one formula: split into cases by the repeat pattern (all different, one pair, two pairs, a triple) and add. This case-split is what the harder problems test.

Number-forming problems, edge cases and what examiners test

Typical JEE Main items: count numbers with a given number of digits from a given set of digits, with or without repetition, with a condition such as even, divisible by 5, greater than a given value, or containing a particular digit. Rules that save marks: fill the most restricted place first; a number cannot start with 0, so the leading place has one fewer choice when 0 is in the set; for even the units place must be 0, 2, 4, 6 or 8; for divisibility by 5 the units digit is 0 or 5; for "greater than 4000" the thousands digit must be at least 4. When the restriction touches two places (for example units 0 and leading nonzero) split into cases on the units digit. Edge cases: a stage whose count depends on an earlier choice (e.g. whether 0 was already used) forces a split into cases; do not multiply blindly. Always sanity-check that the answer does not exceed the unrestricted count.

Memory hook

Suppose a college canteen offers a lunch combo where you pick one sabzi from 3 kinds, one dal from 2 kinds and one dessert from 2 kinds, and you also decide in which order to eat the three items.

  1. Picking one item from each group is a chain of choices: 3 for the sabzi, then 2 for the dal, then 2 for the dessert, so 3 x 2 x 2 = 12 different combos.
  2. Now the order of eating the three chosen items matters: any of 3 items can go first, then 2 are left, then 1, so 3 x 2 x 1 = 6 orders. Total plans = 12 x 6 = 72.
  3. If instead you want to pick only the first and second item to eat from 3 different dishes in order, the count is 3 x 2 = 6, which is P(3, 2).

Each stage multiplies the count, and ordering r items from n different items shrinks the choices by one at every place, which is P(n, r) = n(n - 1)...(n - r + 1).

Stages multiply, alternatives add, and each place in an arrangement has one choice fewer.

Revision card

Try to answer each without looking above.

  1. State the multiplication and addition principles and the key word that signals each.
  2. Write P(n, r) as a product of r factors and as a ratio of factorials; what are P(n, 0), P(n, 1) and P(n, n)?
  3. How many strings of length r are possible from n symbols if repetition is allowed?
  4. How do you count arrangements of all letters of a word with repeated letters?
  5. In a number-forming problem which place do you fill first, and why?
  6. How do you count k-letter strings from a word with repeated letters, such as SUCCESS?

Sources and review

Reviewed Reviewed on 2026-11-20: every number recomputed by code and independently reviewed; textbook section references pending.

  • Method: Every number in worked examples, recall checks and notes recomputed by code; claims recomputed independently by a separate verifier run using other numerical methods; textbook section references not yet attached; wording defects found were fixed afterwards and re-linted (code checks re-run) but not re-reviewed by a second run; syllabus scope compared with the NTA JEE Main 2026 syllabus text (see content/reviews/scope-audit-2026-11-20.md)
  • Reviewer: independent verifier agent run (not the author)
  • Date: 2026-11-20
  • Defects found: 0; fixed: 0
  • Report: content/reviews/learn2-pnc-2026-11-20.md

Textbook references

  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.2 Fundamental Principle of Counting (read 2026-11-22)
  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.3.2 Factorial notation (read 2026-11-22)
  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.3.1 Permutations when all the objects are distinct (read 2026-11-22)
  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.3.3 Derivation of the formula for nPr (read 2026-11-22)
  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.3.4 Permutations when all the objects are not distinct objects (read 2026-11-22)

Sources used

  • Syllabus: NTA JEE (Main) 2026 syllabus, Mathematics, Unit 4 (https://jeemain.nta.nic.in/document/syllabus-2026/), text copied from the repository syllabus line file
  • NCERT Class 11 Mathematics, chapter on Permutations and Combinations: scope reference only, not opened for this draft; content written fresh and textbook section references are pending

How labels work: see how answers and lessons are verified. Found a mistake? Use Report an error on any question page.