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

Construct an equal-tail two-sided Poisson decision

Allocate a two-sided level explicitly when the discrete distribution is asymmetric.

Statistics 2 · Hypothesis tests · 6.5
Exam scope and assessment notes

Probability & Statistics 2 (Paper 6, A Level) · Mathematics 9709, 2026–2027, section 6.5. Paper 6 builds on Paper 5 and assumes Paper 3 calculus. Specify population hypotheses, significance level, test statistic and tail direction before inspecting the result. Calculate tail probabilities under H₀, including the observed discrete value. A p-value is not the probability that H₀ is true. Reject H₀ when the specified tail probability is at most the stated significance threshold; otherwise do not reject. The syllabus term acceptance region means the non-rejection region, not proof of H₀. For two-sided discrete examples here, use an explicitly stated equal-tail allocation; asymmetric discrete models admit different conventions, so do not treat twice the smaller tail as a universal definition. Integer critical regions can have actual Type I probability below the nominal level. Normal approximations need a suitable model and continuity correction for counts; check exact probabilities when approximation could change a close decision. Mean tests use a normal population with known variance or an adequate large independent sample with estimated variance. Small samples with unknown variance do not automatically justify the z method. Type I means rejecting a true null; Type II means not rejecting a false null at a specified alternative. Calculate error probabilities using the fixed decision region under the relevant parameter, not by changing the test after seeing data. Power is one minus Type II probability at that alternative. Quoted normal critical values and table probabilities have rounding limits. Interpret evidence in context without claiming certainty, causation or practical importance. Written practice is self-checked; cumulative assessment and human subject-teacher review remain pending.

Before you begin

  • Evaluate Poisson cumulative probabilities.
  • Understand two-sided tail allocation.

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

Quick readiness check

How should the two-sided Poisson tails be found?

What you will learn

  • Find two Poisson critical tails.
  • Calculate actual size without assuming symmetry.
Po(4) point probabilities are drawn at zero through sixteen. The stated equal-tail 5% rule rejects zero or counts at least nine. The lower probability is approximately 0.0183156389 and the complete upper probability approximately 0.0213634345, giving actual size approximately 0.0396790734. The infinite upper tail extends beyond the picture; unequal achieved tails fit equal allowances.Poisson counts · infinite supportPo(4)0916Reject X ≤ 0 or X ≥ 9Actual size ≈ 0.0396791Equal allowances · integer boundariesPositive tail extends beyond sixteen
Po(4) point probabilities are drawn at zero through sixteen. The stated equal-tail 5% rule rejects zero or counts at least nine. The lower probability is approximately 0.0183156389 and the complete upper probability approximately 0.0213634345, giving actual size approximately 0.0396790734. The infinite upper tail extends beyond the picture; unequal achieved tails fit equal allowances.

Use separate tail searches

For Po(4), H₁: λ ≠ 4 and nominal 5%, allocate at most 0.025 to each tail. The lower event X ≤ 0 has probability e⁻⁴ ≈ 0.0183156389, while X ≤ 1 has probability about 0.0915781944. The upper event X ≥ 9 has probability about 0.0213634345, while X ≥ 8 has probability about 0.0511336158.

The stated equal-tail rejection rule is X = 0 or X ≥ 9. Its disjoint probabilities sum to about 0.0396790734. The two tail probabilities are unequal even though their allowances are equal.

State the convention in the conclusion

Under this rule, zero or nine events reject; eight events do not. The conclusion is evidence of a rate change, with the observed direction noted separately. Non-rejection still does not prove the original rate.

This lesson uses equal-tail allocation. Do not silently apply a symmetric-tail shortcut to Poisson masses or substitute a different two-sided convention after seeing the count.

Pause and explain

What is the actual size of the stated rule?

Put the idea to work

Worked example

Construct the equal-tail 5% Po(4) rejection rule.

Show the worked solution
  1. Lower budget admits only X = 0.
  2. Upper budget admits X ≥ 9.
  3. Actual size is e⁻⁴ + P₀(X ≥ 9) ≈ 0.0396790734.

Answer X = 0 or X ≥ 9; actual size 0.0396790734.

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

Find the equal-tail 5% Po(4) rejection rule.

Give me a hint

Allow at most 0.025 in each direction.

Compare my reasoning
  1. The lower boundary is zero.
  2. The upper boundary is nine.
  3. Reject for X = 0 or X ≥ 9.

X = 0 or X ≥ 9.

Look for these in your work

  • Check separate tails.
  • Use their union.
2 · Independent

Calculate its actual Type I probability.

Give me a hint

Add the two disjoint null region probabilities.

Compare my reasoning
  1. Lower probability is e⁻⁴ ≈ 0.0183156389.
  2. Upper probability is approximately 0.0213634345.
  3. Sum gives 0.0396790734.

Actual size approximately 0.0396790734.

Look for these in your work

  • Use the null mean.
  • Do not impose symmetry.
3 · Transfer

Classify observed eight under this rule.

Give me a hint

Check membership of the pre-specified union.

Compare my reasoning
  1. Eight is not zero.
  2. Eight is below nine.
  3. It lies in the non-rejection region.

Do not reject at the stated equal-tail 5% level.

Look for these in your work

  • Use the specified rule.
  • Avoid changing conventions afterwards.

Common mistakes

  • Poisson tails are not symmetric.
  • Each tail must fit its budget.
  • Do not double one actual tail to obtain region size.
Recall without your notes

What can you explain now?

Are equal tail allowances the same as equal achieved tail probabilities?

Compare with the explanation

No.

Discrete probabilities need not use equal amounts of their allowances.

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

Equal-tail budgets for asymmetric count models require two separate boundary searches.

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.