EngineeringRise

Combinations and Selections: JEE Main Maths Notes

Reviewed Last updated 2026-11-20. Syllabus topic: Combinations and selections.

In short. A combination is an unordered selection: C(n, r) = n!/(r!(n - r)!) counts the ways to choose r of n different objects. It is P(n, r) divided by r!, and it satisfies C(n, r) = C(n, n - r).

  • C(n, r) = n!/(r!(n - r)!) = P(n, r)/r! counts selections where order does not matter.
  • C(n, r) = C(n, n - r), C(n, 0) = C(n, n) = 1, and C(n, r) + C(n, r - 1) = C(n + 1, r).
  • For conditions such as exactly k of a kind, multiply the group-wise selections; for at least k, add the cases or subtract the complement from the total.
  • The number of non-empty selections from n different objects is 2ⁿ - 1.
  • In geometry, triangles from points subtract the collinear triples, and lines subtract the repeated lines through collinear points.

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

Related topics

The concept step by step

  1. Step 1: Selecting a group, where order does not matter

    A combination is a selection in which only the chosen group matters. Picking Asha, Bilal and Chitra is the same group whichever name you say first. The number of ways to choose r objects from n different objects is written C(n, r). Use it when the chosen objects do the same job and are not given positions.

  2. Step 2: Deriving C(n, r) from P(n, r)

    Ordered choices of r from n number P(n, r). Each group of r objects appears r! times among them, once for every order of the same r objects. So the number of groups is P(n, r)/r!, that is C(n, r) = n!/(r!(n - r)!). Example: C(8, 3) = 336/6 = 56.

  3. Step 3: Symmetry and boundary values

    Choosing r objects to take is the same as choosing n - r objects to leave behind, so C(n, r) = C(n, n - r). Hence C(100, 98) = C(100, 2) = 4950, which is much easier. Also C(n, 0) = 1 (choose nothing), C(n, n) = 1 (choose everything) and C(n, 1) = n.

  4. Step 4: Choosing from separate groups

    When objects come in groups, such as 7 men and 4 women, choose from each group separately and multiply the counts, because the choices are independent. A team of 5 with exactly 2 women has C(4, 2) women selections and C(7, 3) men selections, so 6 x 35 = 210 teams. Check that the numbers chosen add to the team size.

  5. Step 5: At least, at most and the complement

    For "at least 2 women" in a team chosen from 4 women, add the cases with 2, 3 and 4 women. For "at least one", it is shorter to take all selections and subtract those with none. A group of 4 from 6 boys and 5 girls with at least one girl: 330 - 15 = 315. Never pick the special object first and then everyone else, since that counts some groups many times.

  6. Step 6: Points, lines and polygons

    Any 2 points fix one line and any 3 non-collinear points fix a triangle. With n points and no three in a line, lines = C(n, 2) and triangles = C(n, 3). If k points lie on one line, subtract C(k, 3) triples for triangles, and for lines subtract C(k, 2) then add 1 because those pairs make only a single line. A convex n-gon has C(n, 2) - n diagonals.

Worked examples

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

Example 1 (easy)

In how many ways can a committee of 3 be chosen from 10 people?

Marks-style solution of example 1
StepMarks
The three members hold equal roles, so order is irrelevant and a combination is needed.1
C(10, 3) = 10 x 9 x 8/(3 x 2 x 1).1
C(10, 3) = 720/6 = 120.1
Total: 3 marks3

Answer: 120

Fast method: C(10, 3) = (10 x 9 x 8)/6 = 120.

Sanity check: It must be smaller than P(10, 3) = 720 by exactly the factor 3! = 6, and 720/6 = 120.

Example 2 (easy)

If C(n, 2) = 45, find n.

Marks-style solution of example 2
StepMarks
C(n, 2) = n(n - 1)/2, so n(n - 1) = 90.1
n² - n - 90 = 0 factorises as (n - 10)(n + 9) = 0.1
n must be positive, so n = 10.1
Total: 3 marks3

Answer: 10

Fast method: Look for two consecutive numbers with product 90: 9 x 10, so n = 10.

Sanity check: C(10, 2) = 10 x 9/2 = 45 confirms it; n = -9 is rejected because n counts objects.

Example 3 (medium)

A team of 5 is to be chosen from 7 men and 4 women so that it contains exactly 2 women. In how many ways can this be done?

Marks-style solution of example 3
StepMarks
Exactly 2 women means exactly 3 men.1
Women: C(4, 2) = 6. Men: C(7, 3) = 35.2
Groups are chosen independently, so multiply: 6 x 35 = 210.1
Total: 4 marks4

Answer: 210

Fast method: C(4, 2) x C(7, 3) = 6 x 35.

Sanity check: The count must be below C(11, 5) = 462 (all teams of 5), and 210 is a little under half of it, as expected when exactly 2 of 4 women are chosen.

Example 4 (medium)

A group of 4 is to be chosen from 6 boys and 5 girls so that it contains at least one girl. In how many ways can this be done?

Marks-style solution of example 4
StepMarks
All groups of 4 from 11 people: C(11, 4) = 330.1
Groups with no girl (all 4 are boys): C(6, 4) = 15.1
At least one girl = 330 - 15 = 315.1
Total: 3 marks3

Answer: 315

Fast method: Total minus the all-boys groups: 330 - 15.

Sanity check: It must lie between the exactly-one-girl count 5 x C(6, 3) = 100 and the total 330; 315 is just below 330 because almost every group has a girl.

Typical trap: Choosing one girl first (5 ways) and then any 3 of the other 10 people gives 5 x C(10, 3) = 600. A group with two girls is counted once for each of its girls, so the count is inflated.

Example 5 (hard, multi-step)

Nine points lie in a plane; exactly 4 of them are collinear and no other three are collinear. How many different straight lines pass through at least two of these points?

Marks-style solution of example 5
StepMarks
Count pairs of points: C(9, 2) = 36, and each pair fixes a line.1
The C(4, 2) = 6 pairs among the collinear points all give the same single line, so remove those 6 pairs.2
Add back the one line they share: lines = 36 - 6 + 1.2
Number of lines = 31.1
Total: 6 marks6

Answer: 31

Fast method: C(9, 2) - C(4, 2) + 1 = 36 - 6 + 1.

Sanity check: With no collinear triple there would be 36 lines; collinearity can only reduce the count, and 31 is lower by 5 (6 pairs merged into 1 line).

Typical trap: Answering C(9, 2) = 36 counts the line through the four collinear points 6 times.

Example 6 (hard, multi-step)

A committee of 4 is to be chosen from 9 people, two of whom, X and Y, refuse to serve together. In how many ways can the committee be formed?

Marks-style solution of example 6
StepMarks
Total committees of 4 from 9: C(9, 4) = 126.1
Committees that contain both X and Y: the other 2 members come from the remaining 7, C(7, 2) = 21.2
Allowed committees = 126 - 21.1
Number of committees = 105.1
Total: 5 marks5

Answer: 105

Fast method: Total minus the committees that hold both people: 126 - C(7, 2) = 126 - 21.

Sanity check: The answer must be below 126, and the forbidden fraction is about (4/9) x (3/8) = 1/6 of 126, which is 21, so 105 is right.

Typical trap: Adding the committees that contain X, C(8, 3) = 56, and those that contain Y, 56, gives 112. Each of these counts includes committees with both people, and committees with neither person are missed. Subtract the forbidden case from the total instead.

Formulas and units

Formula and unit box for Combinations and selections
ResultFormulaValid whenUnits or noteWorked example
CombinationsC(n, r) = n!/(r!(n - r)!)choose r of n distinct objects, order ignored, 0 <= r <= ndimensionlessExample 1
Link with permutationsP(n, r) = C(n, r) x r!n distinct objects, 0 <= r <= ndimensionlessnone
SymmetryC(n, r) = C(n, n - r)integers 0 <= r <= ndimensionlessnone
Boundary valuesC(n, 0) = C(n, n) = 1, C(n, 1) = nn a non-negative integerdimensionlessnone
Pascal ruleC(n, r) + C(n, r - 1) = C(n + 1, r)integers n and r with 1 <= r <= ndimensionlessnone
Equal valuesC(n, x) = C(n, y) implies x = y or x + y = nintegers x, y between 0 and ndimensionlessnone
Non-empty selectionsone or more of n different objects: 2ⁿ - 1n different objects, any number chosen, at least onedimensionlessnone
Triangles with k collinearC(n, 3) - C(k, 3)n points, k collinear, no other three collineardimensionlessnone
Lines with k collinearC(n, 2) - C(k, 2) + 1n points, exactly k collinear, no other three collineardimensionlessExample 5
Diagonals of n-gonC(n, 2) - nconvex polygon with n >= 3 sidesdimensionlessnone

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

  • Using P(n, r) for a group selection, or C(n, r) when positions or roles differ. Why it tempts: Both give integers, and words such as "choose" and "form" appear in both kinds of problem.
  • Counting "at least one" by choosing the special object first and the rest freely. Why it tempts: It sounds natural and produces a clean product such as 5 x C(10, 3), but groups with several special objects are counted more than once.
  • Forgetting to subtract the collinear triples (or pairs) in triangle and line counts. Why it tempts: The unrestricted C(n, 3) or C(n, 2) is the first formula remembered and appears as an option.
  • Taking C(n, r) = n!/(r! x n - r!) or cancelling factorials incorrectly. Why it tempts: The bracket (n - r)! is easy to misread as n! - r!, and the wrong value is still an integer.
  • Ignoring that a polygon side is not a diagonal, giving C(n, 2) instead of C(n, 2) - n. Why it tempts: Every pair of vertices joins by a segment, and the n sides are easy to forget.

Time per question and fast method

Target: about 85 seconds per question.

Decide first whether the order matters. For conditions, check whether the complement is shorter: "at least one" is almost always total minus none. Use symmetry C(n, r) = C(n, n - r) to keep r small, and quote C(n, 2) = n(n - 1)/2 and C(n, 3) directly.

Recall quiz

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

Question 1. The value of C(12, 2) is
Show the answer

Answer: B: 66. C(12, 2) = 12 x 11/2 = 66, the number of pairs from 12 objects.

Question 2. The value of C(15, 13) is
Show the answer

Answer: D: 105. C(15, 13) = C(15, 2) = 15 x 14/2 = 105 by the symmetry C(n, r) = C(n, n - r).

Question 3. In how many ways can one or more of 5 different fruits be chosen?
Show the answer

Answer: A: 31. Each fruit is taken or left, giving 2⁵ = 32 selections, and removing the empty selection leaves 31.

Question 4. The number of diagonals of a convex polygon with 10 sides is
Show the answer

Answer: B: 35. All pairs of vertices give C(10, 2) = 45 segments; 10 of them are sides, so diagonals = 45 - 10 = 35.

Question 5. The value of C(8, 3) + C(8, 4) is
Show the answer

Answer: C: 126. By the Pascal rule C(8, 3) + C(8, 4) = C(9, 4) = 126; directly 56 + 70 = 126.

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

Definition and the link with P(n, r)

A combination of r objects from n different objects is a selection of r of them in which order is ignored. Each selection of r objects can be ordered in r! ways, and these r! orderings together make the r! different permutations that use the same objects, so P(n, r) = C(n, r) x r!, giving C(n, r) = n!/(r!(n - r)!) = n(n - 1)...(n - r + 1)/r!. The symbol is defined for whole numbers with 0 <= r <= n and is 0 otherwise. Selecting r objects to take is the same as selecting n - r objects to leave, so C(n, r) = C(n, n - r); this is the quickest way to evaluate C(100, 98) = C(100, 2). Also C(n, 0) = C(n, n) = 1 and C(n, 1) = n. The answer is always a whole number; a fractional result signals a slip in the arithmetic.

Standard identities and equations

Pascal rule: C(n, r) + C(n, r - 1) = C(n + 1, r), which follows by splitting the selections of r from n + 1 objects according to whether one fixed object is included. Another useful form is C(n, r) = (n/r) x C(n - 1, r - 1). If C(n, x) = C(n, y) with x not equal to y then x + y = n, because equal values arise only from the symmetry pair. To solve an equation such as C(n, 2) = 45, write n(n - 1)/2 = 45, so n(n - 1) = 90 and n = 10 (the negative root is rejected). The sum of all C(n, r) for r = 0 to n is 2ⁿ, the number of subsets of an n-element set; removing the empty selection gives 2ⁿ - 1 non-empty selections, the standard answer to "in how many ways can one or more of n different things be chosen". Quick values to know: C(6, 3) = 20, C(7, 3) = 35, C(8, 4) = 70, C(10, 3) = 120.

Selections with conditions: exactly, at least, at most

When the objects fall into groups (men and women, red and blue balls), choose from each group separately and multiply: the number of ways to take 2 women from 5 and 3 men from 6 is C(5, 2) x C(6, 3). "Exactly k" of a kind is one such product. "At least k" is the sum of the cases k, k + 1, ... up to the maximum possible; "at most k" is the sum from 0 to k. When the sum has many terms, use the complement: total selections minus the selections that break the condition. For at least one girl in a group of 4 from 6 boys and 5 girls the answer is C(11, 4) - C(6, 4) = 330 - 15 = 315. Do not count "choose one girl first, then choose the rest from everyone": it counts a group with two girls twice, because the group g1, g2, b, b arises once for each girl chosen first. When two particular people may not both be present, subtract the selections that contain both: C(9, 4) - C(7, 2) when 4 are chosen from 9.

Geometry-style counting, edge cases and what examiners test

Simple applications reduce to choosing points, lines or vertices. Any 2 points fix a line and any 3 non-collinear points fix a triangle, so with n points and no three collinear there are C(n, 2) lines and C(n, 3) triangles. If k of the points are collinear, the C(k, 3) triples on that line give no triangle, so triangles = C(n, 3) - C(k, 3); and the C(k, 2) pairs on that line all give the same single line, so lines = C(n, 2) - C(k, 2) + 1. A convex polygon with n vertices has C(n, 2) - n diagonals (all pairs of vertices except the n sides). A rectangle on a grid is fixed by choosing 2 of the vertical lines and 2 of the horizontal lines. The commonest tests are: at-least conditions with the complement, collinear points, a pair of persons that must or must not be together in a committee, and a selection followed by an arrangement, for which you multiply by the arrangement count after choosing. Always confirm the answer cannot exceed C(total, r).

Memory hook

Suppose your class needs 3 of its 8 friends to go and collect the tickets for a film, and all three do the same job, so it does not matter who walks in first.

  1. If you named the three in the order of who stands first, second and third in the queue, you would have 8 x 7 x 6 = 336 ordered choices, which is P(8, 3).
  2. But the group Asha, Bilal, Chitra is the same group however the three line up, and 3 people can line up in 3! = 6 ways, so each group was counted 6 times.
  3. Dividing, the number of different groups is 336/6 = 56, which is C(8, 3).

Choosing a group means ordered choices divided by the orderings of the chosen objects: C(n, r) = P(n, r)/r!.

Pick the group first; order is only a count you divide away.

Revision card

Try to answer each without looking above.

  1. Write C(n, r) as a ratio of factorials and as P(n, r)/r!.
  2. State the symmetry rule and use it to evaluate C(50, 48).
  3. How do you count a selection with "exactly k" of one kind, and with "at least k"?
  4. What is the number of ways to choose one or more of n different objects?
  5. How many triangles and how many lines do n points give when k of them are collinear?
  6. What is the formula for the number of diagonals of a convex n-sided polygon?

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: 1; fixed: 1
  • Report: content/reviews/learn2-pnc-2026-11-20.md

Textbook references

  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, 6.4 Combinations (read 2026-11-22)
  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, Example 18 Combinations (worked example, committee) (read 2026-11-22)
  • NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 6: Permutations and Combinations, Example 21 Miscellaneous Examples (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.