Learn in your language
Skip to content
A Level · Cambridge (CIE) · 9709

Keep objects apart with complements and gaps

Subtract forbidden adjacency for a pair, or place separated objects into gaps around an existing row.

Statistics 1 · Permutations and combinations · 5.2
Exam scope and assessment notes

Probability & Statistics 1 (Paper 5, AS & A Level) · Mathematics 9709, 2026–2027, section 5.2. State whether order matters, objects are distinguishable, repetition is permitted and positions or rows are labelled. Count mutually exclusive cases before adding them; account for internal arrangements when using blocks. These lessons include seating in two or more rows. Arrangements in a circle are excluded from this syllabus section. Unless a question says otherwise, people and named roles are distinguishable, and selection is without replacement. Written practice is self-checked; human subject-teacher review remains pending.

Before you begin

  • Use adjacency blocks and combinations.
  • Count orders of distinct and repeated objects.

Work on paper. Try each question before revealing help, and explain why your method works.

Quick readiness check

How many gaps surround a row of three objects, including both ends?

What you will learn

  • Count non-adjacent pairs using a complement.
  • Use gaps for several separated objects and distinguish identical from distinct copies.
Three different girls G1, G2, G3 create four gaps, including both ends. Two different boys occupy two distinct gaps to prevent boy adjacency. Arrange girls in 3! ways, choose gaps in 4C2 ways, then assign boys in 2! ways, giving 72 rows. The illustrated row B1, G1, G2, B2, G3 uses gaps 0 and 2.Include both end gapsG1G2G30123Choose gaps 0 and 2, for exampleB1G1G2B2G33! girl orders · 4C2 gap choices2! assignments of distinct boys6 × 6 × 2 = 72 rows
Three different girls G1, G2, G3 create four gaps, including both ends. Two different boys occupy two distinct gaps to prevent boy adjacency. Arrange girls in 3! ways, choose gaps in 4C2 ways, then assign boys in 2! ways, giving 72 rows. The illustrated row B1, G1, G2, B2, G3 uses gaps 0 and 2.

A complement handles one forbidden pair

Among five different people A–E, there are 5! = 120 unrestricted rows. A and B together give 2!4! = 48 forbidden rows. Therefore A and B not adjacent gives 120 − 48 = 72. These two cases partition all rows, so subtraction is exact.

For several objects that must be mutually separated, separate pairwise forbidden counts can overlap. A gap construction is often easier. Arrange three different girls first in 3! ways. There are four gaps: before the first girl, between successive girls and after the last. Put two different boys into two different gaps to ensure no boy adjacency.

Choose gaps and then allocate distinct objects

For three different girls and two different boys, choose two of the four gaps in 4C2 ways and assign boys in 2! ways. The total is 3! × 4C2 × 2! = 72. Both end gaps count. At most one boy per gap enforces the restriction; placing both in one gap would allow adjacency.

For four identical A and three identical B with no adjacent B, the A row has five gaps. Choose three gaps in 5C3 = 10 ways. There is no 4! factor for identical A and no 3! factor for identical B. If the separated objects outnumber available gaps, there are zero arrangements, rather than a factorial expression with a negative argument.

Pause and explain

Three distinct girls and two distinct boys, no adjacent boys: what count is correct?

Put the idea to work

Worked example

Seat three distinct girls and two distinct boys in one row with no adjacent boys.

Show the worked solution
  1. Arrange the girls in 3! = 6 ways, opening four gaps.
  2. Choose two different gaps in 4C2 = 6 ways.
  3. Assign the boys in 2! = 2 ways, giving 6 × 6 × 2 = 72.

Answer 72 arrangements.

Try a topic test

Choose Easy, Normal or Difficult. Save your answers and open worked review after finishing.

Test this topic →

From guided practice to a new situation

Write your answer and reasoning first. Use a hint only if you are stuck. The model solution is for self-checking; your written work is not automatically marked.

1 · Guided

Arrange A, B, C, D, E in a row with A and B not adjacent. Use a complement.

Give me a hint

Subtract the adjacent-block count from all five-person rows.

Compare my reasoning
  1. All rows number 5! = 120.
  2. Adjacent A and B give 2! × 4! = 48.
  3. The valid complement has 120 − 48 = 72 rows.

72 arrangements.

Look for these in your work

  • Identify the forbidden condition exactly.
  • Subtract from the correct unrestricted universe.
2 · Independent

Arrange four different girls and three different boys in a row, with no adjacent boys.

Give me a hint

The girl row creates five gaps and the boys need three distinct gaps.

Compare my reasoning
  1. Arrange girls in 4! = 24 ways.
  2. Choose three of five gaps in 5C3 = 10 ways and order boys in 3! = 6 ways.
  3. Multiply 24 × 10 × 6 = 1440.

1440 arrangements.

Look for these in your work

  • Include both end gaps.
  • Distinguish choosing gaps from assigning boys.
3 · Transfer

Count distinct strings using four identical A and three identical B with no adjacent B.

Give me a hint

There is one visible A row, surrounded by five gaps.

Compare my reasoning
  1. Write AAAA; it creates five possible B gaps.
  2. Choose three different gaps in 5C3 = 10 ways.
  3. Identical copies contribute no additional internal ordering factors.

10 strings.

Look for these in your work

  • Use at most one B per gap.
  • Avoid factorials for indistinguishable copies.

Common mistakes

  • Include the gaps at both ends.
  • Assign distinct objects after choosing gaps.
  • Do not multiply for identical copies or use overlapping complements uncorrected.
Recall without your notes

What can you explain now?

Can three mutually non-adjacent B copies be placed around just one A?

Compare with the explanation

No; a single A creates only two gaps.

Each occupied gap can contain at most one B under the non-adjacency restriction.

After trying it yourself, choose your next review. This is your self-assessment.

Your review choice appears on Today. Sign in to sync it across devices.

Make it stick

For one pair, subtract adjacency; for many separated objects, build the base row and fill distinct gaps.

If you needed the solution, close it and solve the problem again from a blank page. A correct answer is stronger when you can explain the reason for each step.

Keep learning Mathematics

Course scope and assessment

312 sequenced lessons provide 936 guided, independent and application problems covering the 160 objectives in sections 1.1–1.8, 2.1–2.6, 3.1–3.9, 4.1–4.5, 5.1–5.5 and 6.1–6.5. The map lists all 38 sections across six alternative components; all eight Pure Mathematics 1 sections and all six Pure Mathematics 2 sections, from Paper 2 Algebra through Numerical solution of equations, currently have full teaching sequences. Paper 3 Algebra, section 3.1, links the six shared foundation lessons plus six lessons on partial fractions and rational binomial expansions; Paper 3 logarithms, trigonometry and numerical equations use the shared lessons, with the Paper 1 graph foundation linked into trigonometry. Paper 3 differentiation combines the shared methods with its inverse-tangent derivative lesson. Paper 3 Integration links four shared standard and identity lessons plus seven advanced lessons, covering all six section 3.5 requirements. Eight Vectors lessons cover all six section 3.7 requirements, with 2D and 3D line and solid applications. Nine Differential equations lessons cover all four section 3.8 requirements, including Paper 3 integration techniques, initial conditions, equilibrium solutions and conditional model interpretations. Eleven Complex numbers lessons cover all eight section 3.9 requirements, with seven Argand diagrams and explicit argument and boundary checks. All nine Pure Mathematics 3 sections now have teaching linked to every mapped requirement. Nine Forces and equilibrium lessons cover all seven section 4.1 requirements, with six force diagrams, signed incline-friction intervals, reaction-dependent pull and push limits and separate-body third-law checks. Nine Kinematics lessons cover the four official section 4.2 requirements, with the graph requirement mapped to three relationships. Six motion diagrams support directed quantities, graph slopes and signed areas, Paper 1 time-calculus methods, reversal distances, constant-acceleration stages and shared-clock particle meetings. Six Momentum lessons cover both section 4.3 requirements, including signed system totals, conservation assumptions, outgoing velocities, coalescence, unknown masses and successive impacts. Four diagrams show system momentum through the stipulated events, and supplied kinetic-energy checks distinguish conservation of momentum from changes in kinetic energy. Twelve Newton’s laws lessons cover all four section 4.4 requirements, with vertical support and release stages, rough horizontal and incline motion, inferred parameters, hanging and surface pulley systems, rigid tow-bar thrust and slack-string transitions. Seven force diagrams support the separate-particle balances. Nine Energy, work and power lessons cover all five section 4.5 requirements, with angle-dependent work, kinetic and reference potential energy, signed net-work balances, smooth curved slides, rough and driven slopes, ideal connected-system energy and instantaneous power on hills. Five diagrams distinguish the energy inputs, losses and valid positive-speed force model. All five Mechanics sections now have teaching and staged practice linked to their mapped requirements. Thirteen Representation of data lessons cover all five section 5.1 requirements, including choice and limitations of displays, ordered and back-to-back stems, raw summaries and box plots, unequal-width density histograms, cumulative-frequency interpolation, descriptive moment calculations, grouped estimates, coding, combining two datasets and correcting totals. Six accessible diagrams retain repeated observations and distinguish numerical spread, frequency area and estimated readings. Ten Permutations and combinations lessons cover both official section 5.2 requirements, with selection and ordered roles, repeated objects, adjacency blocks, non-adjacency gaps, leading-zero cases, labelled multi-row seating and mixed restrictions. Six accessible diagrams show outcome trees, ordered versus unordered choices, repeated copies, blocks, gaps and distinct row seats. Eleven Probability lessons cover all four section 5.3 requirements, with equiprobable elementary outcomes, selection-based probabilities, complements and disjoint regions, independence tests, restricted sample spaces, two-way tables, replacement and removal trees, reversed conditions and unknown parameters. Seven accessible diagrams show dice outcomes, random subsets, event regions, a conditioned grid, a count table and two probability trees. Twelve Discrete random variables lessons cover all three official section 5.4 requirements, with complete probability tables, moment and parameter checks, binomial assumptions, exact probabilities and moments, geometric first-success probabilities, tails, expectation and integer reliability thresholds. Six accessible diagrams distinguish outcome grouping, weighted moments, fixed trials, discrete probability bars, waiting conventions and integer tail deadlines. Twelve Normal distribution lessons cover all three official section 5.5 requirements, with continuous-area interpretation, MF19 cumulative tables, full standardisation, tail and interval regions, conditional probabilities, percentiles, one- and two-parameter inference, binomial suitability, continuity corrections and approximate integer thresholds. Seven accessible diagrams show model areas, table reading, aligned scales, intervals, quantiles, matched binomial and normal shapes and whole integer cells. All five Statistics 1 sections now have teaching and staged practice linked to their mapped requirements. Fourteen Poisson distribution lessons cover all five official section 6.1 requirements, with homogeneous event-count assumptions, exposure scaling, exact masses and tails, conditional count events, moments, parameter inference, probability duration targets, disjoint and overlapping windows, rare-count binomial approximations, matched normal approximations and continuity corrections. Nine accessible diagrams show event exposures, unit conversions, discrete bars, complete tail complements, population moments, shared windows, approximate count models and integer cells. Exact checks distinguish approximate and exact close-target decisions. Fourteen Linear combinations lessons cover the six listed results in official section 6.2, with affine moments, signed scales and constant cases, expectation without independence, independent squared variance contributions, fixed and random fees, independent copies versus reused values, affine normal events, independent normal sums and differences, weighted and conditional areas, coefficient inference, exact independent Poisson sums and overlapping exposure limits. Nine accessible diagrams distinguish scale changes, variance contributions, component costs, copy mechanisms, aligned normal scales, summed areas, Poisson count pairs and unsupported distribution claims. Fourteen Continuous random variables lessons cover both official section 6.3 requirements, with density validity and units, support-aware intervals, complements and conditional regions, first and second moments, percentiles by direct density areas, symmetry checks, parameter inference, infinite-support power and exponential integrals, divergent-moment limits and combined applications. Nine accessible diagrams distinguish density height from probability, normalisation, negative-density failures, central and conditional areas, mean versus median, percentile locations and partial infinite tails. Explicit cumulative distribution function knowledge is not required. Eighteen Sampling and estimation lessons cover all eight official section 6.4 requirements, with population and frame definitions, random-number selection, sampling-quality limits, independent sample-mean moments, normal means, CLT conditions, SE scaling, raw, summarised and coded unbiased estimates, known-variance and large-sample mean intervals, repeated-sampling interpretation, precision planning, proportion intervals, sparse-outcome limits and contextual applications. Ten accessible diagrams distinguish selection frames, number rejection, repeated sample means, population versus mean density, CLT models, variance divisors, interval targets, illustrative coverage, integer size checks and proportion margins. Eighteen Hypothesis tests lessons cover all five official section 6.5 requirements, with pre-specified alternatives, inclusive count tails, explicit equal-tail conventions, integer critical regions and actual significance, exposure-aware Poisson tests, continuity-corrected count approximations, normal and large-sample mean tests, confidence-interval connections, error classifications, fixed-region binomial, Poisson and normal error probabilities and sample-size power comparisons. Nine accessible diagrams show the testing procedure, exact count regions, unequal Poisson tails, discrete significance jumps, corrected count boundaries, matching mean intervals and alternative error distributions. All shared lessons are counted once in the course total. All 38 sections now link teaching and practice. Eight earlier overview lessons remain available, but do not count as full section coverage. This is a content-availability measure, not full programme completion or exam readiness. Written practice is self-checked, not officially marked. Check the 2028–2030 syllabus separately if sitting an examination from 2028; this teaching map uses 2026–2027 requirements.

StudyForA · Learn with understanding

Original teaching content and links to official sources. Check your exam year and qualification before using a resource.