Mathematics · Book 2 · Grades 10–12

High School Mathematics

High School Mathematics · Grades 10–12

3Functions

A function is a machine that takes a number in and produces a number out, always the same output for the same input. Functions are the central objects of the analysis you will build over the next years (Chapter 10 onward); this chapter sets up the vocabulary — domain, image, graph, variations — and trains the essential skill of reading information off a graph.

3.1 Vocabulary: images and preimages

Definition 3.1 (Function)

Let DD be a set of real numbers. A function ff defined on DD associates to each number xDx \in D exactly one real number, written f(x)f(x) and called the image of xx. The set DD is the domain of ff. We write

f:xf(x).f : x \longmapsto f(x).

If f(x)=yf(x) = y, then xx is a preimage of yy.

Remark 3.2

Each xx in the domain has exactly one image, but a number yy can have several preimages, or none. For f(x)=x2f(x) = x^2: the image of 33 is 99, and 99 has two preimages, 33 and 3-3; the number 4-4 has no preimage.

Example 3.3 (Finding a domain)

When a function is given by a formula, its domain is the set of xx for which the formula makes sense.

  • f(x)=3x25x+1f(x) = 3x^2 - 5x + 1 makes sense for every xx: the domain is R\R.
  • g(x)=1x2g(x) = \dfrac{1}{x - 2} requires x20x - 2 \neq 0: the domain is all reals except 22.
  • h(x)=x3h(x) = \sqrt{x - 3} requires x30x - 3 \geq 0: the domain is [3,+)\intco{3}{+\infty}.

Example 3.4 (Computing images and preimages)

Let f(x)=x24x+3f(x) = x^2 - 4x + 3, defined on R\R.

Image of 55: substitute x=5x = 5: f(5)=2520+3=8f(5) = 25 - 20 + 3 = 8.

Preimages of 33: solve f(x)=3f(x) = 3:

x24x+3=3x24x=0x(x4)=0,x^2 - 4x + 3 = 3 \quad\Longleftrightarrow\quad x^2 - 4x = 0 \quad\Longleftrightarrow\quad x(x - 4) = 0,

so the preimages of 33 are 00 and 44.

3.2 The graph of a function

Definition 3.5 (Graph)

In a coordinate system, the graph (or curve) of ff is the set of all points (x,f(x))(x, f(x)) for xx in the domain. In other words, a point (x,y)(x, y) lies on the graph exactly when y=f(x)y = f(x).

Reading an image on a graph: start from x = 3 on the horizontal axis, go vertically to the curve, then horizontally to the vertical axis to read f(3) = 1.25.
Reading an image on a graph: start from x=3x = 3 on the horizontal axis, go vertically to the curve, then horizontally to the vertical axis to read f(3)=1.25f(3) = 1.25.

Method 3.6 (Reading a graph)

On the graph of ff:

  1. image of aa: go vertically from x=ax = a on the horizontal axis to the curve, then horizontally to the vertical axis; the value read there is f(a)f(a);
  2. preimages of bb: draw the horizontal line y=by = b; the preimages are the xx-coordinates of all its intersection points with the curve;
  3. solutions of f(x)=kf(x) = k: same as the preimages of kk;
  4. solutions of f(x)kf(x) \leq k: the xx for which the curve is on or below the line y=ky = k.
Solving f(x) = k graphically: the solutions x_1 and x_2 are the abscissas of the intersection points of the curve with the horizontal line y = k. Here f(x) ≤ k holds on [x_1, x_2], where the curve is below the line.
Solving f(x)=kf(x) = k graphically: the solutions x1x_1 and x2x_2 are the abscissas of the intersection points of the curve with the horizontal line y=ky = k. Here f(x)kf(x) \leq k holds on [x1,x2]\intcc{x_1}{x_2}, where the curve is below the line.

Example 3.7

Is the point A(2,5)A(2, 5) on the graph of f(x)=x2+1f(x) = x^2 + 1? Compute f(2)=4+1=5f(2) = 4 + 1 = 5: yes, since f(2)f(2) equals the yy-coordinate of AA. The point B(3,8)B(3, 8) is not on the graph, because f(3)=108f(3) = 10 \neq 8.

3.3 Variations of a function

Definition 3.8 (Increasing, decreasing)

Let ff be defined on an interval II.

  • ff is increasing on II when for all u,vIu, v \in I, if u<vu < v then f(u)f(v)f(u) \leq f(v): the outputs grow with the inputs, and the graph climbs from left to right.
  • ff is decreasing on II when u<vu < v implies f(u)f(v)f(u) \geq f(v): the graph falls from left to right.

With strict inequalities f(u)<f(v)f(u) < f(v) (resp. >>) we say strictly increasing (resp. decreasing).

Definition 3.9 (Variation table)

A variation table summarizes on which intervals ff increases and decreases, with arrows \nearrow and \searrow, and records the values of ff at the turning points.

Example 3.10

Consider the function graphed below on [2,4]\intcc{-2}{4}.

A function defined on [-2, 4], increasing then decreasing.
A function defined on [2,4]\intcc{-2}{4}, increasing then decreasing.

Reading the graph: ff increases from f(2)=1.5f(-2) = -1.5 up to its maximum f(1)=3f(1) = 3, then decreases down to f(4)=1.5f(4) = -1.5. Its variation table is

xx2-21144
ff1.5-1.5\nearrow33\searrow1.5-1.5

Example 3.11 (Proving a variation)

Show that f(x)=3x+1f(x) = 3x + 1 is strictly increasing on R\R. Take any u<vu < v and compare the images:

f(v)f(u)=(3v+1)(3u+1)=3(vu)>0,f(v) - f(u) = (3v + 1) - (3u + 1) = 3(v - u) > 0,

because vu>0v - u > 0. So f(u)<f(v)f(u) < f(v): the function is strictly increasing. The same computation with a negative slope, e.g. g(x)=2x+5g(x) = -2x + 5, gives g(v)g(u)=2(vu)<0g(v) - g(u) = -2(v-u) < 0: strictly decreasing.

3.4 Extrema

Definition 3.12 (Maximum, minimum)

Let ff be defined on DD and aDa \in D. The value f(a)f(a) is the maximum of ff on DD when f(x)f(a)f(x) \leq f(a) for all xDx \in D; it is the minimum when f(x)f(a)f(x) \geq f(a) for all xDx \in D. On a graph, they are the highest and lowest points of the curve.

Example 3.13

Show that f(x)=(x1)2+2f(x) = (x - 1)^2 + 2 has minimum 22 on R\R, attained at x=1x = 1. For every xx, the square (x1)2(x-1)^2 is 0\geq 0, so f(x)=(x1)2+22f(x) = (x-1)^2 + 2 \geq 2; and f(1)=0+2=2f(1) = 0 + 2 = 2, so the value 22 is actually reached. Both facts together prove that 22 is the minimum.

The curve of f(x) = (x-1)2 + 2 never goes below the dashed line y = 2, and touches it at x = 1: the minimum of f is 2.
The curve of f(x)=(x1)2+2f(x) = (x-1)^2 + 2 never goes below the dashed line y=2y = 2, and touches it at x=1x = 1: the minimum of ff is 22.

3.5 Exercises

Exercise 3.1

Let f(x)=2x23x+1f(x) = 2x^2 - 3x + 1. Compute the images of 00, 22, 1-1 and 12\frac12.

Solution

Solution of Exercise 3.1.

f(0)=1f(0) = 1; f(2)=86+1=3f(2) = 8 - 6 + 1 = 3; f(1)=2+3+1=6f(-1) = 2 + 3 + 1 = 6; f ⁣(12)=2×1432+1=1232+1=0f\!\left(\tfrac12\right) = 2 \times \tfrac14 - \tfrac32 + 1 = \tfrac12 - \tfrac32 + 1 = 0.

Exercise 3.2

Give the domain of each function:

f(x)=5x2,g(x)=3x+4,h(x)=2x6,k(x)=1x2+1.f(x) = 5x - 2, \qquad g(x) = \frac{3}{x + 4}, \qquad h(x) = \sqrt{2x - 6}, \qquad k(x) = \frac{1}{x^2 + 1}.
Solution

Solution of Exercise 3.2.

ff: no constraint, domain R\R.

gg: requires x+40x + 4 \neq 0, domain all reals except 4-4.

hh: requires 2x602x - 6 \geq 0, i.e. x3x \geq 3: domain [3,+)\intco{3}{+\infty}.

kk: x2+11>0x^2 + 1 \geq 1 > 0 never vanishes, domain R\R.

Exercise 3.3

Let f(x)=x22xf(x) = x^2 - 2x. Find all preimages of 00, of 33, and of 1-1.

Solution

Solution of Exercise 3.3.

Preimages of 00: x22x=x(x2)=0x^2 - 2x = x(x-2) = 0, so 00 and 22.

Preimages of 33: x22x=3x^2 - 2x = 3, i.e. x22x3=0x^2 - 2x - 3 = 0, i.e. (x3)(x+1)=0(x-3)(x+1) = 0 (check by expanding), so 33 and 1-1.

Preimages of 1-1: x22x+1=(x1)2=0x^2 - 2x + 1 = (x - 1)^2 = 0, so the single preimage 11.

Exercise 3.4

Does the point A(1,4)A(-1, 4) belong to the graph of f(x)=x22x+1f(x) = x^2 - 2x + 1? And the point B(2,1)B(2, 1)? Justify by a computation.

Solution

Solution of Exercise 3.4.

f(1)=1+2+1=4f(-1) = 1 + 2 + 1 = 4: yes, A(1,4)A(-1, 4) is on the graph. f(2)=44+1=1f(2) = 4 - 4 + 1 = 1: yes, B(2,1)B(2, 1) is on the graph too.

Exercise 3.5

A function gg defined on [3,5]\intcc{-3}{5} has the variation table

xx3-3003355
gg11\searrow2-2\nearrow44\searrow00
  1. What are the maximum and the minimum of gg on [3,5]\intcc{-3}{5}?
  2. Compare g(1)g(-1) and g(0.5)g(-0.5) without knowing their values.
  3. How many solutions does the equation g(x)=0g(x) = 0 have at most on each interval of the table?
Solution

Solution of Exercise 3.5.

1. The largest value in the table is 4=g(3)4 = g(3) (maximum), the smallest is 2=g(0)-2 = g(0) (minimum).

2. On [3,0]\intcc{-3}{0} the function decreases, and 1<0.5-1 < -0.5, so g(1)g(0.5)g(-1) \geq g(-0.5).

3. On each interval of monotonicity, gg takes each value at most once, so g(x)=0g(x) = 0 has at most one solution per interval: at most 33 solutions in total. (Here 00 lies between 2-2 and 11, between 2-2 and 44, and between 00 and 44, so there are exactly three.)

Exercise 3.6 ★★

Let f(x)=2x+7f(x) = -2x + 7. Show, by comparing f(u)f(u) and f(v)f(v) for u<vu < v, that ff is strictly decreasing on R\R.

Solution

Solution of Exercise 3.6.

Let u<vu < v. Then

f(v)f(u)=(2v+7)(2u+7)=2(vu)<0,f(v) - f(u) = (-2v + 7) - (-2u + 7) = -2(v - u) < 0,

since vu>0v - u > 0. So f(v)<f(u)f(v) < f(u): ff is strictly decreasing on R\R.

Exercise 3.7 ★★

Show that the function f(x)=x2+6x+11f(x) = x^2 + 6x + 11 has a minimum on R\R, and give its value and where it is attained. (Hint: write f(x)=(x+3)2+cf(x) = (x + 3)^2 + c for the right constant cc.)

Solution

Solution of Exercise 3.7.

Complete the square: (x+3)2=x2+6x+9(x+3)^2 = x^2 + 6x + 9, so

f(x)=x2+6x+11=(x+3)2+2.f(x) = x^2 + 6x + 11 = (x + 3)^2 + 2 .

For every xx, (x+3)20(x+3)^2 \geq 0, so f(x)2f(x) \geq 2; and f(3)=0+2=2f(-3) = 0 + 2 = 2. The minimum of ff is 22, attained at x=3x = -3.

Exercise 3.8 ★★

A rectangular garden has perimeter 4040 m. Let xx be its width, in meters.

  1. Express the length, then the area A(x)A(x), as functions of xx. For which xx does this make sense?
  2. Compute A(4)A(4), A(8)A(8), A(10)A(10), A(12)A(12) and A(16)A(16). What do you conjecture about the shape of largest area?
Solution

Solution of Exercise 3.8.

1. Length ++ width =20= 20, so the length is 20x20 - x and

A(x)=x(20x).A(x) = x(20 - x).

Both dimensions must be positive: 0<x<200 < x < 20.

2. A(4)=64A(4) = 64, A(8)=96A(8) = 96, A(10)=100A(10) = 100, A(12)=96A(12) = 96, A(16)=64A(16) = 64. The values rise until x=10x = 10 then fall symmetrically: the area seems largest for x=10x = 10, i.e. for a square garden. (Chapter 10 proves this conjecture.)

Exercise 3.9 ★★

Let f(x)=1x2+1f(x) = \dfrac{1}{x^2 + 1}, defined on R\R.

  1. Show that 0<f(x)10 < f(x) \leq 1 for every real xx.
  2. Does ff have a maximum on R\R? A minimum? Justify.
Solution

Solution of Exercise 3.9.

1. For every xx: x2+11>0x^2 + 1 \geq 1 > 0, so f(x)=1x2+1f(x) = \frac{1}{x^2+1} is positive, and since x2+11x^2 + 1 \geq 1, taking inverses (both sides positive) gives f(x)1f(x) \leq 1.

2. Maximum: f(0)=1f(0) = 1 and f(x)1f(x) \leq 1 for all xx, so 11 is the maximum, attained at 00. Minimum: f(x)>0f(x) > 0 always, but no value of xx achieves 00 (a quotient of nonzero numbers is nonzero), and ff takes values as close to 00 as we like for large xx; so ff has no minimum.

Exercise 3.10 ★★★

Let f(x)=x2f(x) = x^2 on R\R.

  1. Let 0u<v0 \leq u < v. Factor f(v)f(u)f(v) - f(u) and deduce that ff is strictly increasing on [0,+)\intco{0}{+\infty}.
  2. Adapt the argument to show that ff is strictly decreasing on (,0]\intoc{-\infty}{0}.
Solution

Solution of Exercise 3.10.

1. f(v)f(u)=v2u2=(vu)(v+u)f(v) - f(u) = v^2 - u^2 = (v-u)(v+u). If 0u<v0 \leq u < v, then vu>0v - u > 0 and v+u>0v + u > 0 (sum of a nonnegative and a positive number), so f(v)f(u)>0f(v) - f(u) > 0: ff is strictly increasing on [0,+)\intco{0}{+\infty}.

2. If u<v0u < v \leq 0, then vu>0v - u > 0 still, but now v+u<0v + u < 0 (sum of a nonpositive and a negative number), so f(v)f(u)<0f(v) - f(u) < 0: ff is strictly decreasing on (,0]\intoc{-\infty}{0}.

3.6 Problem: Machines fed their own output

Problem 3.1

Weekend problem — fixed points, iteration, and three famous machines: Heron’s improver, the squarer, and the unsolved hailstone

A function is a machine: a number goes in, a number comes out. The most interesting experiments feed the machine its own output, again and again — and then two questions dominate: does the process settle somewhere (a fixed point), and how does the machine’s variation drive it there? One of this problem’s machines has been polishing square roots for two thousand years; another guards the most famous unsolved problem elementary mathematics has to offer.

Part I — Heron’s machine. Consider the function

f(x)=12(x+2x).f(x) = \frac12\left(x + \frac2x\right).
  1. Give the domain of ff, and compute f(1)f(1), f(2)f(2) and f ⁣(32)f\!\left(\frac32\right) as exact fractions.
  2. Find all preimages of 32\frac32: solve f(x)=32f(x) = \frac32 (clear the denominator and use the methods of Problem 2.1).
  3. A fixed point of ff is a number unchanged by the machine: f(x)=xf(x) = x. Find both fixed points of ff. Which old acquaintance guards the positive one?
  4. Starting from x=1x = 1, feed the machine its own output three times and record the exact results. Which sequence of the irrationality weekend problem of the Middle School volume have you rebuilt — and what was “Heron’s recipe”, in the language of functions?
  5. On one picture, sketch the graph of ff (for x>0x > 0) and the diagonal line y=xy = x. Where are the fixed points on this picture? (Compare the two-thermometers weekend problem of the Middle School volume: the temperature reading the same in both scales was the same idea.)

Part II — Why the machine cannot miss.

  1. For 0<u<v0 < u < v, show by reduction to a common denominator that

    f(v)f(u)=(vu)(uv2)2uv,f(v) - f(u) = \frac{(v - u)(uv - 2)}{2uv} ,

    and deduce the variations of ff on (0,+)\intoo{0}{+\infty}: decreasing up to a point, then increasing — which point? (Same technique as Exercise 3.10.)

  2. Deduce that on (0,+)\intoo{0}{+\infty} the function ff has a minimum, worth exactly 2\sqrt2, attained at 2\sqrt2. What does this say about every output of the machine (positive inputs)?
  3. Show that if x>2x > \sqrt2 then 2<f(x)<x\sqrt2 < f(x) < x: a too-big guess is always improved, never overshot. (For f(x)<xf(x) < x, compare 2x\frac2x with xx.)
  4. Assemble questions 6–8 into the variation table of ff on (0,+)\intoo{0}{+\infty} (Definition 3.9), minimum included.
  5. A second machine: g(x)=x2g(x) = x^2. Its fixed points are 00 and 11 (check). Iterate gg four times from x=0.9x = 0.9, then four times from x=1.1x = 1.1 (calculator, three decimals). One fixed point attracts, the other repels: which is which?

Part III — The hailstone machine. On the whole numbers, define: h(n)=n2h(n) = \frac n2 if nn is even, and h(n)=3n+1h(n) = 3n + 1 if nn is odd. Numbers bounce under hh like hailstones in a storm cloud.

  1. Compute the full flight of 77 under hh, down to 11. How many steps does it take, and how high does it fly?
  2. Start the flight of 2727 and compute ten steps. (Its full flight lasts 111111 steps and peaks at 92329\,232 — from a starting point of 2727.) What lesson about simple rules do 77 and 2727 teach?
  3. Explain why any flight that reaches a power of 22 crashes straight to 11, and what happens at 11 (compute h(1)h(1), h(4)h(4), h(2)h(2)). Does hh have any fixed point among the positive whole numbers? What does the end of every observed flight form instead?
  4. The Collatz conjecture claims every starting number eventually reaches 11. Computers have verified it far beyond 102010^{20}; no human has proved it. What two kinds of discovery would disprove it? And why does massive verification still not close the case (the matchstick-oracle weekend problem of the Middle School volume rang this bell)?
  5. “Mathematics is not yet ripe for such questions,” said Paul Erdős of this conjecture. In one sentence: what separates the hailstone machine from Heron’s, where questions 6–8 settled everything?

Part IV — The machine user’s manual.

  1. Domains as intervals (Problem 1.1’s language): give the domains of xx3x \mapsto \sqrt{x - 3}, x1x29x \mapsto \frac{1}{x^2 - 9}, x9x2x \mapsto \sqrt{9 - x^2}.
  2. Back to Heron’s ff: find the exact preimages of 33 (solve f(x)=3f(x) = 3 by completing the square).
  3. A stone is thrown upward: its height is H(t)=20t5t2H(t) = 20t - 5t^2 meters after tt seconds. On which time interval does the formula make physical sense? Complete the square to find the maximal height and its time (Definition 3.12), and give the variation table.
  4. For how long is the stone at least 1515 m high? (Solve H(t)15H(t) \geq 15 with a sign table, Method 2.17.)
  5. Finale: this problem ran four machines — Heron’s improver, the squarer, the hailstone, the stone’s height. In two or three sentences, state what every function has (a domain, a rule, a graph) and the two great questions this problem asked of each (where does iteration settle? how does the function vary?) — questions the next chapters take up one by one.
Solution

Solution of Problem 3.1.

1. Domain: x0x \neq 0 (division by xx). f(1)=12(1+2)=32f(1) = \frac12(1 + 2) = \frac32; f(2)=12(2+1)=32f(2) = \frac12(2 + 1) = \frac32; f ⁣(32)=12(32+43)=1712f\!\left(\frac32\right) = \frac12\left(\frac32 + \frac43\right) = \frac{17}{12}.

2. 12(x+2x)=32\frac12\left(x + \frac2x\right) = \frac32 gives x2+2=3xx^2 + 2 = 3x, i.e. x23x+2=(x1)(x2)=0x^2 - 3x + 2 = (x - 1)(x - 2) = 0: the preimages of 32\frac32 are 11 and 22 — as question 1 announced.

3. f(x)=xf(x) = x gives x+2x=2xx + \frac2x = 2x, so 2x=x\frac2x = x, x2=2x^2 = 2: fixed points 2\sqrt2 and 2-\sqrt2. The positive one is the diagonal of the unit square, irrational by the irrationality weekend problem of the Middle School volume.

4. 13217125774081 \to \frac32 \to \frac{17}{12} \to \frac{577}{408}: Heron’s approximations of 2\sqrt2. His recipe “average the guess with 2/2/guess” is exactly iterating the function ff — and the number the process chases is ff’s fixed point.

5. The fixed points are the crossings of the graph with the diagonal y=xy = x: feeding outputs back in walks the point along the graph towards that crossing. In the two-thermometers weekend problem of the Middle School volume, the reading 40-40^\circ was the same crossing-the-diagonal idea for the conversion function.

6. f(v)f(u)=vu2+1v1u=vu2+uvuv=(vu)(121uv)=(vu)(uv2)2uvf(v) - f(u) = \frac{v - u}{2} + \frac1v - \frac1u = \frac{v - u}{2} + \frac{u - v}{uv} = (v - u)\left(\frac12 - \frac{1}{uv}\right) = \frac{(v - u)(uv - 2)}{2uv}. For 0<u<v20 < u < v \leq \sqrt2: uv<2uv < 2, the bracket is negative, f(v)<f(u)f(v) < f(u): decreasing. For 2u<v\sqrt2 \leq u < v: uv>2uv > 2: increasing. Turning point: 2\sqrt2.

7. Decreasing before 2\sqrt2, increasing after: ff attains its minimum at 2\sqrt2, worth f(2)=12(2+22)=2f(\sqrt2) = \frac12\left(\sqrt2 + \frac{2}{\sqrt2}\right) = \sqrt2. Consequence: every output of the machine (positive input) is at least 2\sqrt2 — after one turn of the crank, guesses live in [2,+)\intco{\sqrt2}{+\infty}.

8. If x>2x > \sqrt2, then x2>2x^2 > 2, so 2x<x\frac2x < x and the average f(x)f(x) of xx and 2x\frac2x is less than xx; and f(x)2f(x) \geq \sqrt2 by question 7, with equality only at x=2x = \sqrt2. So 2<f(x)<x\sqrt2 < f(x) < x: each iteration strictly improves without overshooting — the sequence of question 4 slides down onto 2\sqrt2.

9. On (0,+)\intoo{0}{+\infty}: decreasing from ++\infty (near 00) down to the minimum 2\sqrt2 at x=2x = \sqrt2, then increasing without bound.

10. g(x)=xg(x) = x gives x2=xx^2 = x, x(x1)=0x(x - 1) = 0: fixed points 00 and 11. From 0.90.9: 0.810.81, 0.6560.656, 0.4300.430, 0.1850.185 — sliding towards 00. From 1.11.1: 1.211.21, 1.4641.464, 2.1442.144, 4.5954.595 — fleeing to infinity. The fixed point 00 attracts, 11 repels: a hair’s difference at the start, opposite destinies.

11. 72211341752261340201051684217 \to 22 \to 11 \to 34 \to 17 \to 52 \to 26 \to 13 \to 40 \to 20 \to 10 \to 5 \to 16 \to 8 \to 4 \to 2 \to 1: sixteen steps, peaking at 5252.

12. 278241124623194471427121427 \to 82 \to 41 \to 124 \to 62 \to 31 \to 94 \to 47 \to 142 \to 71 \to 214 \to \dots — still climbing after ten steps, on its way to a peak of 92329\,232 and a 111111-step flight. Lesson: a two-line rule can produce behavior no one can predict at a glance — next-door numbers (2626, 2727, 2828) have wildly different flights.

13. A power of 22 halves down its whole ladder: 2k2k1212^k \to 2^{k-1} \to \dots \to 2 \to 1. At the bottom, h(1)=4h(1) = 4, h(4)=2h(4) = 2, h(2)=1h(2) = 1: the flight enters the cycle 42144 \to 2 \to 1 \to 4. Fixed points would need n2=n\frac n2 = n (only n=0n = 0) or 3n+1=n3n + 1 = n (negative): none among the positive integers — the observed flights end not at a fixed point but in that little cycle.

14. A counterexample would be either a flight that grows forever (never returning to 11) or a second cycle disjoint from 4214 \to 2 \to 1. Verification up to 102010^{20} leaves infinitely many untested numbers — exactly the circle-regions lesson of the matchstick-oracle weekend problem of the Middle School volume: agreement on finitely many cases proves nothing about all of them.

15. For Heron’s machine we had structure — a factored difference (question 6) revealing variations, a minimum, a squeeze — while the hailstone’s parity-switching rule offers no such handle: nobody has found the structure that tames it.

16. x3\sqrt{x - 3}: needs x30x - 3 \geq 0: [3,+)\intco{3}{+\infty}. 1x29\frac{1}{x^2 - 9}: needs x±3x \neq \pm 3: R\R deprived of 3-3 and 33. 9x2\sqrt{9 - x^2}: needs x29x^2 \leq 9: [3,3]\intcc{-3}{3}.

17. f(x)=3f(x) = 3 gives x+2x=6x + \frac2x = 6, so x26x+2=0x^2 - 6x + 2 = 0, i.e. (x3)2=7(x - 3)^2 = 7: x=37x = 3 - \sqrt7 or x=3+7x = 3 + \sqrt7 (both positive: two exact preimages).

18. Physical sense while the stone is aloft: H(t)=5t(4t)0H(t) = 5t(4 - t) \geq 0 for t[0,4]t \in \intcc{0}{4}. Completing: H(t)=205(t2)2H(t) = 20 - 5(t - 2)^2: maximum 2020 m at t=2t = 2 s. Variations: increasing on [0,2]\intcc{0}{2} from 00 to 2020, decreasing on [2,4]\intcc{2}{4} back to 00.

19. 20t5t215    t24t+30    (t1)(t3)0    t[1,3]20t - 5t^2 \geq 15 \iff t^2 - 4t + 3 \leq 0 \iff (t - 1)(t - 3) \leq 0 \iff t \in \intcc{1}{3}: two full seconds above 1515 m.

20. Each machine has a domain (where the rule is allowed), a rule (the formula or the parity switch), and a graph or table displaying it whole. Of each we asked the two great questions: where does repetition lead (fixed points, cycles, attraction — solved for Heron, open for the hailstone) and how does the output move with the input (variations, extrema — the stone’s summit, Heron’s minimum). The chapters ahead sharpen both: reference functions next, then, in later years, derivatives to measure variation and limits to certify where iterations land.