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
  1. Notes
  2. /Arrangements and Selections: Quick Revision
Mathematics

Arrangements and Selections: Quick Revision

A brief note on arrangements and selections: factorials, permutations, combinations, how to decide between them, and the usual conditions. With a worked example, practice, a program and questions to check yourself.

StemPy LabWritten by StemPy Lab
Log in to save

A brief note on Arrangements and Selections. Read it before a test. Try each question at the end before you open its answer.

The tools

  • Multiplication rule: choices made one after another multiply.
  • Factorial: n!=n(n−1)⋯1n! = n(n - 1)\cdots 1n!=n(n−1)⋯1, and 0!=10! = 10!=1.
  • Permutation: nPr=n!(n−r)!{}^{n}P_{r} = \dfrac{n!}{(n - r)!}nPr​=(n−r)!n!​. The order matters.
  • Combination: nCr=n!r! (n−r)!{}^{n}C_{r} = \dfrac{n!}{r!\,(n - r)!}nCr​=r!(n−r)!n!​. The order does not matter.
  • Symmetry: nCr=nCn−r{}^{n}C_{r} = {}^{n}C_{n - r}nCr​=nCn−r​.

Choosing the method

  • Ask: does a different order give a different result?
  • Together: glue the people into a block, then multiply by the orders inside the block.
  • Apart: subtract the "together" count from all the arrangements.
  • Must be chosen: remove that person and choose the rest from the others.
  • At least one: subtract the "none" case from the total.
  • Numbers: fill the place with the condition first.

A worked example

How many 333-letter codes can be made from the letters P, Q, R, S, T, with no letter used twice?

  1. Does the order matter? Yes: PQR and QRP are different codes.
  2. Use a permutation. 5P3=5×4×3=60{}^{5}P_{3} = 5 \times 4 \times 3 = 605P3​=5×4×3=60.

Practice with new numbers

A program to try

The program prints the permutations, the combinations and the combinations found by dividing, for three cases.

Read it first. Then run it. What do you notice about the last two columns?

1. Add the case (7, 2). Predict both counts first.

Mistakes to avoid

  • A permutation where the order does not matter.
  • Forgetting the swap inside a block of people who sit together.
  • Starting a number with 000.
  • Keeping a negative or fractional nnn.

Check yourself

  1. Work out 8P3{}^{8}P_{3}8P3​.
  1. Work out 9C7{}^{9}C_{7}9C7​.
  1. In how many ways can 444 people be seated in a row of 444 chairs?
  1. A group of 101010 chooses a team of 333, and one named member must be in it. How many teams?
  1. Solve nC2=15{}^{n}C_{2} = 15nC2​=15.

Sources

  • Cambridge International, IGCSE Additional Mathematics 0606 syllabus, unit 11.
← All Notes
← Circles and Radians: Quick RevisionVectors and Trigonometric Graphs: Quick Revision →
More onAlgebra › Permutations and Combinations

Discussion (0)

Log in to join the discussion.

Loading…

On this page

  1. The tools
  2. Choosing the method
  3. A worked example
  4. Practice with new numbers
  5. A program to try
  6. Mistakes to avoid
  7. Check yourself
  8. Sources

Goes with the lesson

  1. Permutation or combination?Counting Arrangements and Selections

More notes on this topic

  1. Combinations: Quick Revision
  2. Permutations: Quick Revision
  3. The Fundamental Principle of Counting: Quick Revision
All notes on this topic →