HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
Counting Arrangements and Selections
  1. 1Factorials and permutations
  2. 2Combinations
  3. 3Permutation or combination?
  1. Mathematics
  2. /Counting Arrangements and Selections
  3. /Combinations

Course 22.2·Lesson 2 of 3

Combinations

When the order does not matter, each group is counted several times by a permutation, so we divide. You use the combination formula, see why the numbers are symmetrical, choose from two groups, count a selection with at least one of something by subtraction, and count pairs and handshakes.

about 25 min1 simulation1 practice question1 Python program5 questions to check yourself

This lesson is free to read. Enroll free to keep your place and take the tests.

Lesson 2 of 3Show all lessonsHide
Counting Arrangements and Selections
  1. 1Factorials and permutations
  2. 2Combinations
  3. 3Permutation or combination?

Try the code and the simulations beside the lesson.

This lesson is Additional Mathematics, unit 11 of Cambridge IGCSE Additional Mathematics 0606, outcomes 11.1 to 11.3. A problem uses either permutations or combinations, never both in one question, and the objects are all different.

Order does not matter

A coach picks 333 players from 555 for a relay team. The team A, B, C is the same team as C, B, A. We only care who is chosen, not the order.

Count the ordered choices first: 5P3=60{}^{5}P_{3} = 605P3​=60. But every team of 333 people appears 3!=63! = 63!=6 times in that list, once for each order. So the number of different teams is 606=10\dfrac{60}{6} = 10660​=10.

We write this nCr{}^{n}C_{r}nCr​ and call it a combination:

nCr=nPrr!=n!r! (n−r)!.\displaystyle {}^{n}C_{r} = \frac{{}^{n}P_{r}}{r!} = \frac{n!}{r!\,(n - r)!}.nCr​=r!nPr​​=r!(n−r)!n!​.

Some books write (nr)\dbinom{n}{r}(rn​). It is the same number, and you will meet it in the binomial theorem.

A grid of four rows and four columns labelled A, B, C and D. The cells are the ordered pairs of two different letters: the first letter is the row and the second letter is the column. The cells above the diagonal, AB, AC, AD, BC, BD and CD, are blue. The six cells below the diagonal, BA, CA, CB, DA, DB and DC, are orange. The cells on the diagonal are empty.

The grid shows it for n=4n = 4n=4 and r=2r = 2r=2. The 121212 ordered pairs form 666 unordered pairs, because ABABAB and BABABA share one pair. The blue cells show one of each. So 4C2=122=6{}^{4}C_{2} = \dfrac{12}{2} = 64C2​=212​=6.

Useful facts

  • nC0=1{}^{n}C_{0} = 1nC0​=1 and nCn=1{}^{n}C_{n} = 1nCn​=1. There is one way to choose nothing and one way to choose everything.
  • nC1=n{}^{n}C_{1} = nnC1​=n.
  • nCr=nCn−r{}^{n}C_{r} = {}^{n}C_{n - r}nCr​=nCn−r​. Choosing rrr to take is the same as choosing n−rn - rn−r to leave.

The last fact saves work: 10C8=10C2=10×92=45{}^{10}C_{8} = {}^{10}C_{2} = \dfrac{10 \times 9}{2} = 4510C8​=10C2​=210×9​=45. For 9C4{}^{9}C_{4}9C4​ you write 9×8×7×64×3×2×1=126\dfrac{9 \times 8 \times 7 \times 6}{4 \times 3 \times 2 \times 1} = 1264×3×2×19×8×7×6​=126.

A bar chart of the number of ways to choose r objects from 8, for r from 0 to 8. The bars have heights 1, 8, 28, 56, 70, 56, 28, 8 and 1. The chart is symmetrical about r equal to 4.

Choosing from two groups

A class has 666 girls and 555 boys. A team has 222 girls and 333 boys. Choose the girls in 6C2=15{}^{6}C_{2} = 156C2​=15 ways and, for each choice, the boys in 5C3=10{}^{5}C_{3} = 105C3​=10 ways. By the multiplication rule there are 15×10=15015 \times 10 = 15015×10=150 teams.

At least one

A committee of 444 is chosen from 555 men and 444 women. How many have at least one woman?

You could add the cases with 111, 222, 333 and 444 women. It is shorter to subtract the case you do not want from the total.

  1. All committees. 9C4=126{}^{9}C_{4} = 1269C4​=126.
  2. No women. All 444 are men: 5C4=5{}^{5}C_{4} = 55C4​=5.
  3. At least one woman. 126−5=121126 - 5 = 121126−5=121.

Pairs and handshakes

Twelve people at a party each shake hands once with every other person. Each handshake is a pair of people, and the order of the pair does not matter. The number is 12C2=12×112=66{}^{12}C_{2} = \dfrac{12 \times 11}{2} = 6612C2​=212×11​=66. The same idea counts the matches in a league where every team plays every other team once.

Practise with new numbers

Try it in Python

The program lists the pairs from four letters, checks the formula and the symmetry, and counts the committee with at least one woman.

Read it first. Then run it. Which line shows the symmetry?

1. Change combinations("ABCD", 2) to choose 333 letters. How many groups are there?

2. Change the last line to teams of 333 from 555 men and 444 women with at least one woman.

Common mistakes

  • Using nPr{}^{n}P_{r}nPr​ when the order does not matter. Each group is then counted r!r!r! times.
  • Forgetting the symmetry. nCr{}^{n}C_{r}nCr​ and nCn−r{}^{n}C_{n - r}nCn−r​ are equal, so use the smaller one.
  • Adding instead of multiplying for two groups. A team has girls and boys, so the counts multiply.
  • Counting the cases for "at least one". Subtracting the "none" case is faster and safer.

Remember these

  • nCr=n!r! (n−r)!{}^{n}C_{r} = \dfrac{n!}{r!\,(n - r)!}nCr​=r!(n−r)!n!​, and nCr=nPrr!{}^{n}C_{r} = \dfrac{{}^{n}P_{r}}{r!}nCr​=r!nPr​​.
  • nCr=nCn−r{}^{n}C_{r} = {}^{n}C_{n - r}nCr​=nCn−r​, with nC0=nCn=1{}^{n}C_{0} = {}^{n}C_{n} = 1nC0​=nCn​=1.
  • Choices from separate groups multiply.
  • For "at least one", subtract the "none" case from the total.

Check yourself

Try each one on your own first. If you are stuck, open a hint. Then check with Show the answer.

  1. Work out 7C3{}^{7}C_{3}7C3​.
  1. Work out 15C13{}^{15}C_{13}15C13​ without a long calculation.
  1. A set of 888 cards is dealt as a hand of 222 to a player. How many different hands are there?
  1. A group has 444 boys and 666 girls. In how many ways can a team of 555 with exactly 222 boys be chosen?
  1. How many teams of 333 from 666 men and 444 women contain at least one woman?

References

  • Cambridge International, IGCSE Additional Mathematics 0606 syllabus (2025, 2026 and 2027), unit 11, outcomes 11.1 to 11.3.

Enroll free in Counting Arrangements and Selections

Every lesson is open to read. Enrolling also lets you:

  • Mark lessons done and carry on where you stopped.
  • Take the tests of this lesson and its course.
  • Count the course towards the certificate for its chapter.
No payment. You can leave at any time.

Problems (3)

A coach has 10 students and must choose a team of 4…Easy · High School (9–10) · by StemPy Lab
A society has 6 senior members and 5 junior members…Medium · High School (9–10) · by StemPy Lab
A teacher has 5 boys and 4 girls. The boys include Ravi and Sam…Hard · High School (9–10) · by StemPy Lab
Next: lesson 3Permutation or combination?
← Counting Arrangements and Selections
← Factorials and permutationsPermutation or combination? →

Discussion (0)

Log in to join the discussion.

Loading…