Solving equations approximately
The roots of many equations cannot be found by an exact formula, so they are computed approximately. Key fact: if a polynomial f(x) has values of opposite signs at the ends of [a, b], i.e. f(a) · f(b) < 0, then f(x) = 0 has at least one root inside the segment (the graph crosses the x-axis). The converse is false: a root may exist even if f(a) · f(b) > 0 (a root repeated an even number of times). In the bisection method we take a segment [a, b] with one root, find its midpoint m = (a + b)/2 and compute f(m); if f(a) · f(m) < 0 the root is in [a, m], otherwise in [m, b]. At each step the segment halves; we stop when b − a < ε and take the midpoint as the approximate root with accuracy ε.
A communication cable 800 m long has a break. A technician tests the middle and learns which half contains the break, then tests the middle of that half. After three tests the suspect section shrinks to 800 : 2³ = 100 m, which is easy to inspect.
Telecom technicians locate faults this way, programmers find an item in a sorted list by binary search, and engineers let a computer find roots of hard equations by halving.
Try to find a given page number (for example page 137) in a printed book by opening it in the middle each time and deciding whether your page is to the left or to the right. Count how many openings you needed.
Pair game “Which side?”: one student thinks of a number from 1 to 100, the other guesses and only hears “higher” or “lower”. The fastest way is to name the middle of the interval each time; discuss how this resembles bisection.