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. /Permutation or combination?

Course 22.2·Lesson 3 of 3

Permutation or combination?

The hardest step is to decide which count a question needs. You ask whether a different order gives a different result. You handle people who must sit together or must be chosen. You solve equations such as the number of permutations equal to 424242, and you learn what this unit leaves out.

about 25 min1 simulation
Lesson 3 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 and 11.3. Problems are either in an everyday setting or about an algebra equation. They are never about repeated objects, never about objects in a circle, and never need permutations and combinations together.

One question decides

Ask yourself: does a different order give a different result?

  • Yes: a permutation. Words such as arrange, line up, rank, order, code, gold and silver, president and secretary.
  • No: a combination. Words such as choose, select, pick, committee, team, hand of cards, pair.

Two examples with the same people. From 888 pupils, choose a team of 333: 8C3=56{}^{8}C_{3} = 568C3​=56. From the same 888 pupils, choose a captain, a deputy and a goalkeeper: 8P3=336{}^{8}P_{3} = 3368P3​=336. In the second problem the jobs are different, so swapping two people gives a new result. And 336=56×3!336 = 56 \times 3!336=56×3!.

Arrangements with a condition

Two people together. Five friends sit in a row. How many ways have A and B next to each other? Glue A and B into one block. Now there are 444 objects to arrange: the block and the other three friends. That is 4!=244! = 244!=24 ways. Inside the block, A and B can swap, so multiply by 222. The total is 2×4!=482 \times 4! = 482×4!=48.

A row of five boxes labelled A, B, C, D and E. The boxes A and B are shaded and enclosed in a red outline, to show that A and B form one block.

Two people apart. Take the total and subtract the "together" arrangements: 5!−48=120−48=725! - 48 = 120 - 48 = 725!−48=120−48=72.

A place that is fixed. If one person must sit in the first seat, they are already placed. The other n−1n - 1n−1 people are arranged in the other seats: (n−1)!(n - 1)!(n−1)! ways.

Conditions on a number. Fill the restricted place first. How many 444-digit numbers can be made from 0,1,2,3,4,50, 1, 2, 3, 4, 50,1,2,3,4,5 with no digit repeated? The first digit cannot be 000, so it has 555 choices. Then the other three places are an ordered choice from the 555 digits left: 5P3=60{}^{5}P_{3} = 605P3​=60. The total is 5×60=3005 \times 60 = 3005×60=300.

Selections with a condition

A team of 555 is chosen from 999 players.

  • A particular player must be in the team. That player is chosen. Choose the other 444 from the other 888: 8C4=70{}^{8}C_{4} = 708C4​=70.
  • A particular player must not be in the team. Choose all 555 from the other 888: 8C5=56{}^{8}C_{5} = 568C5​=56.
  • At least one of a kind. Subtract the "none" case, as in the last lesson.

Equations with nnn

You may be asked to find nnn.

Example 1. Solve nP2=42{}^{n}P_{2} = 42nP2​=42. We have n(n−1)=42n(n - 1) = 42n(n−1)=42, so n2−n−42=0n^2 - n - 42 = 0n2−n−42=0 and (n−7)(n+6)=0(n - 7)(n + 6) = 0(n−7)(n+6)=0. The number nnn must be a positive whole number, so n=7n = 7n=7.

Example 2. Solve nC2=28{}^{n}C_{2} = 28nC2​=28. Then n(n−1)2=28\dfrac{n(n - 1)}{2} = 282n(n−1)​=28, so n(n−1)=56n(n - 1) = 56n(n−1)=56 and n=8n = 8n=8.

Example 3. Solve nC3=2×nC2{}^{n}C_{3} = 2 \times {}^{n}C_{2}nC3​=2×nC2​. Write both sides: n(n−1)(n−2)6=2×n(n−1)2\dfrac{n(n - 1)(n - 2)}{6} = 2 \times \dfrac{n(n - 1)}{2}6n(n−1)(n−2)​=2×2n(n−1)​. Divide by n(n−1)n(n - 1)n(n−1), which is not zero for n≥3n \ge 3n≥3: n−26=1\dfrac{n - 2}{6} = 16n−2​=1, so n=8n = 8n=8.

Always check the answer. Reject a negative or fractional nnn.

Practise with new numbers

Try it in Python

The program lists every row of 555 friends to count the rows with A and B together. It then counts the teams that contain one particular person.

Read it first. Then run it. Do the counts match the rules in the lesson?

1. Use six people, "ABCDEF". Predict the count with A and B together.

2. Change the team size from 5 to 4. What does the rule give?

Common mistakes

  • Forgetting that the block can swap. A and B together has a factor of 222.
  • Choosing a fixed person again. If Kai is in the team, only the other places are chosen.
  • Starting a number with 000. Fill the first place first.
  • Keeping an impossible nnn. A negative or fractional nnn is rejected.

Remember these

  • Ask: does a different order give a different result?
  • For people together, glue them into a block and multiply by the ways to order the block.
  • A person who must be chosen is removed from the count. Choose the rest from the others.
  • Check an answer for nnn: it must be a whole number, big enough for the expression.

Check yourself

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

  1. Which is needed: a permutation or a combination? Choosing 333 of 121212 photographs for an exhibition, without any order.
  1. Six people sit in a row. Two of them must not sit next to each other. How many ways?
  1. A team of 444 is chosen from 101010 players, and one named player must not be in it. How many teams?
  1. Solve nP2=90{}^{n}P_{2} = 90nP2​=90.
  1. How many 333-digit numbers can be made from 0,1,2,3,40, 1, 2, 3, 40,1,2,3,4 with no digit repeated?

References

  • Cambridge International, IGCSE Additional Mathematics 0606 syllabus (2025, 2026 and 2027), unit 11, outcomes 11.1 and 11.3, including the note on what is not included.

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 (4)

An ice cream shop has 8 flavours. A customer picks 3 different flavours for a cone, and the order…Easy · High School (9–10) · by StemPy Lab
Six friends sit in a row of six seats. Two of them are Dev and Eli…Medium · High School (9–10) · by StemPy Lab
Find the positive whole number n in each equation. ⁿP₂ = 90; ⁿC₃ = 56; ^(n + 2)C₂ = 21Medium · High School (9–10) · by StemPy Lab
That was the last lessonBack to the course: take the test
← Counting Arrangements and Selections
← CombinationsNext →

Discussion (0)

Log in to join the discussion.

Loading…

1 practice question
1 Python program
5 questions to check yourself

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

A game writes a four-digit number using the digits 0, 1, 2, 3, 4, 5, each digit at most once…Hard · High School (9–10) · by StemPy Lab

Python Labs (1)

Counting with a conditionPython Lab · by StemPy Lab

Question Sets (1)

Arrangements and Selections: Concept Check10 questions · by StemPy Lab

Notes (1)

Arrangements and Selections: Quick RevisionNote · by StemPy Lab