Check the starting point
- Evaluate a continuous function at trial inputs
- Distinguish a model probability from a simulated frequency
Show the idea
Bisection keeps a valid bracket
| Step | Midpoint | f(midpoint) | Retained interval |
|---|---|---|---|
| 1 | 2.5 | 1.25 | [2, 2.5] |
| 2 | 2.25 | 0.0625 | [2, 2.25] |
| 3 | 2.125 | −0.484375 | [2.125, 2.25] |
For f(x) = − 5, the initial bracket [2,3] contains a positive root. Each retained interval still has endpoint values of opposite signs.
Work through an example
Bisection keeps a valid bracket — explain the representation.
| Step | Midpoint | f(midpoint) | Retained interval |
|---|---|---|---|
| 1 | 2.5 | 1.25 | [2, 2.5] |
| 2 | 2.25 | 0.0625 | [2, 2.25] |
| 3 | 2.125 | −0.484375 | [2.125, 2.25] |
- For f(x) =
− 5, the initial bracket [2,3] contains a positive root. Each retained interval still has endpoint values of opposite signs.
- Connect the labels to the calculation or rule. Numerical convergence and mathematical validity are separate checks.
Answer: For f(x) = − 5, the initial bracket [2,3] contains a positive root. Each retained interval still has endpoint values of opposite signs.
Teach in small steps
- Begin with a short oral check: ask your child to evaluate a continuous function at trial inputs. Then check that they can distinguish a model probability from a simulated frequency. Revisit either skill before adding a new procedure.
- Explore “Bisection keeps a valid bracket” together. For f(x) =
− 5, the initial bracket [2,3] contains a positive root. Each retained interval still has endpoint values of opposite signs. Ask your child to point to the quantities or features used at each step.
- Model the example: Use bisection for
on [1,2]. Pause before each step and invite a prediction. Midpoint 1.5 has square 2.25, so retain[1,1.5]. Next midpoint 1.25 has square 1.5625, so retain[1.25,1.5].
- Work together on the first new practice question: Apply one bisection step to
− 10 = 0 on [3,4]. Have your child attempt the remaining learn questions with less help, then move to apply. Use the checkpoint on a later attempt to see which ideas are retained.
Ask and listen
- How many bisections reduce an initial width 8 to width at most 0.125?
- Why should a numerical algorithm have a maximum iteration count as well as an accuracy goal?
Adapt the practice
More support
Return to “Bisection keeps a valid bracket” and explain one label or step at a time. Numerical convergence and mathematical validity are separate checks. Let your child show a calculation, drawing or spoken explanation before requiring a polished written answer.
More challenge
Try this application after the core method is secure: Design a simulation of drawing two red counters without replacement from 5 red and 4 blue. Describe how the second draw is generated. Then ask which assumption or input could be changed and what would need to be recalculated.
Look for understanding
- The learner can complete and explain this checkpoint task: A simulation records 1890 successes in 6000 trials. Give the estimated probability.
- The learner can address the reasoning or error-checking question: Why should a numerical algorithm have a maximum iteration count as well as an accuracy goal? Accept a correct alternative method, but ask for the mathematical reason.
Choose the next step
If both checks can be explained without prompting, continue to Rational coefficient equations. If a method is still uncertain, repeat the visual example with fresh numbers before progressing.
Put the idea into practice
The matching topic collection includes learn-and-practise, application and checkpoint PDFs with worked answers. Download the free preview to see representative pages.
Explore this topic’s worksheets