Paper 2 · Probability
⏱ Tested in 5+ recent exam questions
Lesson 5 of 9
Probability 5 – Permutations
This tutorial is for members
Read the lesson notes free below — subscribe to watch the full worked video and download the PDF.
Subscribe for full access · €199/yrYou’ll learn
- Count ordered arrangements using nPr = n!/(n−r)! or the slot method
- Handle position constraints like 'I first and S last' by locking slots
- Use the block trick for 'letters together': bunch, arrange, multiply by k!
- Count 'not in alphabetical order' arrangements by subtracting from the total
Most recent exam questions
- 2025 P2 Q9(b)(i) — deferred
- 2025 P2 Q9(b)(ii) — deferred
- 2025 P2 Q9(c)(ii)
- 2024 P2 Q6(a)(i) — deferred
- 2024 P2 Q6(a)(ii) — deferred
💬 Stuck on something in this lesson?
Send your question with this lesson’s name attached — you’ll get a reply by email.