Edexcel · GCSE Maths · 1MA1 · Foundation and Higher

M36 · Probability and experiments

Interactive
revision
Gap
finder
PLCMind
map
VideoDicey
words
BingoEscape
room
AI Exam
Practice
QuizTeachYouTube

Revise the key ideas

Probability language and calculations

  • A probability lies from 0 to 1 inclusive. Impossible events have probability 0; certain events have probability 1. A probability of 0.5 describes an even chance.
    The probability scaleA horizontal scale runs from zero impossible through one half even chance to one certain.0½1impossibleeven chancecertain
    The probability scale
  • For equally likely outcomes, favourable outcomes are the ones matching the event you are counting. Then P(event) = . Count outcomes rather than assuming every named category is equally likely.
  • Worked example: On a fair six-sided die, multiples of 3 are 3 and 6, so their probability is = . Fairness means each face has equal probability.
  • The probabilities of an exhaustive set of mutually exclusive outcomes sum to 1. Exhaustive means all possibilities are covered; mutually exclusive means they cannot happen together.
  • The complement of A is the event that A does not happen: P(not A) = 1 − P(A). If rain has probability 0.3, no rain has probability 0.7 under that model.
  • For mutually exclusive events, P(A or B) = P(A) + P(B). If they overlap, simply adding double-counts the overlap; account for it using a Venn diagram.

Experiments and expected outcomes

  • Relative frequency = . This estimates probability from observations; it is not necessarily the exact theoretical value.
  • Worked example: A spinner lands on red 38 times in 100 spins. Estimated P(red) = 0.38. If this model holds, 250 future spins would have about 250 × 0.38 = 95 red results.
  • Expected frequency = probability × number of trials. With P(success) = , 80 trials have expected frequency 20; the actual count can differ.
  • More trials usually make an unbiased relative-frequency estimate more reliable. It tends towards the theoretical probability for a suitable stable random model, but need not get closer after every extra trial.

    An unbiased estimation method gives estimates that are not systematically too high or too low over many repetitions.

  • Small samples can give misleading proportions. Use a sufficiently large, fair experiment and keep the conditions consistent when estimating future outcomes.
  • Independent trials, where one result does not change the next trial’s probabilities, do not “balance themselves out” on the next trial. After five heads on a fair coin, the next toss still has P(heads) = .

Organising evidence

  • Frequency tables record counts by outcome. A frequency tree splits a total into groups; each parent's count must equal the sum of its branches.
    Counts in a frequency treeSixty students split into thirty-five walkers and twenty-five transport users. Walkers split into twenty bringing lunch and fifteen others; transport users split into ten and fifteen.6035 walk25 transport20 lunch15 other10 lunch15 other
    Counts in a frequency tree
  • Worked example: Of 60 students, 35 walk and 25 use transport. If 20 walkers and 10 transport users bring lunch, the four leaf counts are 20, 15, 10 and 15. They total 60.
  • State assumptions such as a fair die, a representative sample or unchanged conditions. A mathematically correct calculation can still be an unreliable prediction if its model is inappropriate.

Test yourself

50 questions · Sets of 10 from the selected tier. For fractions, use / when typing; for powers, use superscripts or ^. Follow each question's answer format. These quick checks support revision; practise full written solutions and proofs too.

Mind map

Use the branches to recall the ideas and explain their connections. Check the revision notes for the full detail.

View M36 mind map
M36 M36 mind map: Probability, Totals, Experiments, Reliability. A text version follows.
Open the full-size map to zoom. Use the printable view for A4 landscape or enlarge to A3.

Open full-size map Print mind map

Read the mind map as text

Probability

  • Scale / count: 0≤P≤1; favourable/total only if equally likely

Totals

  • Exhaustive: All possibilities covered; mutually exclusive totals sum 1
  • Complement / union: 1−P(A); add exclusive events; overlap needs correction

Experiments

  • Estimate: Relative frequency=successes/trials; spinner38/100 → 0.38
  • Expected: Probability × trials; expected ≠ guaranteed actual

Reliability

  • Trials: More fair trials help; no guarantee of closer every step
  • Independence: Five heads do not change next fair coin probability
  • Evidence: Frequency-tree parent = branches; state model assumptions

Connections

  • Probability → Experiments: Probability models predict expected counts
  • Experiments → Reliability: Experimental evidence depends on fairness and trials

Share this page

Social links open a draft in a new tab for you to review and send.

Report an error or bug

Please do not include your name, school, passwords or other personal information. Responses go to the website owner through Microsoft Forms. Open form in a new tab if it does not load here.