Maxima and minima of single-variable functions
At a Glance
- Frequency: 7 sub-parts across 6 of 13 years (2014, 2018, 2019, 2020, 2024, 2025)
- Priority tier: T2
- Marks (count): 10 (1), 13 (2), 15 (1), 20 (3)
- Average solve time: ~12 min
- Difficulty mix: medium 4, hard 2, easy 1
- Section: A | Dominant type: computation
Why This Chapter Matters
Single-variable optimisation appears in 6 of the last 13 years at 10–20 marks, almost entirely in Section A. The three archetypes rotate: applied optimisation (geometry and word problems reduced to one variable), critical-point analysis on FTC-defined integrals, and extrema on closed intervals. The applied-optimisation type dominates (4 of 7 questions, including the 20-mark 2024 question) and requires a clear geometric setup before any calculus. The FTC-based critical-point analysis (2020, 20 marks) is the hardest variant — it demands sign-table reasoning across four roots. The closed-interval extremum is the most mechanical: evaluate at critical points and both endpoints.
Minimum Theory
Critical points and the first-derivative test. (or does not exist) at a critical point . If changes from positive to negative at , then is a local maximum; negative to positive gives a local minimum.
Second-derivative test. If and , then is a local maximum; gives a local minimum; is inconclusive.
Closed-interval extremum (Extreme Value Theorem). On , the absolute maximum and minimum are attained at either a critical point interior to or at an endpoint. Evaluate at all critical points in and at ; the largest value is the maximum, the smallest is the minimum.
FTC-defined functions. If , then by the FTC, . To find critical points of , solve ; classify by the sign of (which is ) on either side.
Applied optimisation — standard setup. Identify the quantity to optimise and the geometric/physical constraint; use the constraint to reduce to one variable; differentiate and solve; check endpoints and that the critical point is the correct type.
Question Archetypes
Three patterns cover every single-variable optimisation question in the corpus.
| Archetype | You are seeing this when… |
|---|---|
| applied-optimization | a geometric/physical quantity to maximise or minimise; constraint eliminates one variable |
| critical-point-analysis | ; find critical points and classify them; count zeros |
| extrema-on-interval | find the maximum and minimum of on a closed interval |
applied-optimization (4 question(s); 2014, 2018, 2024, 2025)
Recognition Cues
- “Find the [greatest/maximum/minimum] [volume/distance/height/side] of [a cylinder/box/distance from a point/shape].”
- A geometric constraint (inscribed in a sphere, inscribed in a cone, folded from a sheet) links two variables; one substitution leaves a one-variable problem.
- The 2024 question (20 marks) is “find the volume of the greatest cylinder inscribed in a cone” — the standard hard variant.
Solution Template
- Draw and label. Assign one free variable (e.g. radius or height ).
- Write the constraint. Use similar triangles, Pythagoras, or the geometric relationship to express the other dimension in terms of the free variable.
- Express the objective function or in one variable.
- Differentiate and set to zero. Solve for the critical point(s).
- Confirm maximum via or endpoint values.
- State the answer (value of the optimised quantity and, if asked, the corresponding dimensions).
Worked Example(s)
2014 Paper 1, 2014-P1-Q3a (15 marks)
Find the height of the cylinder of maximum volume inscribed in a sphere of radius .
Let half-height be ; base radius satisfies . Volume .
. : maximum.
2024 Paper 1, 2024-P1-Q3b (20 marks)
Find the volume of the greatest cylinder inscribed in a cone of height and semi-vertical angle .
Cylinder radius , base at distance from apex (where cylinder height). Similar triangles: … Let the cylinder top be at distance from the apex: , height .
.
at .
. .
Note: cylinder height is always , independent of .
2018 Paper 1, 2018-P1-Q2b (13 marks)
Find the shortest distance from to the parabola .
Parametrise: points on are . Squared distance: . Minimised at giving .
The perfect-square collapse is the key insight; is the focus.
2025 Paper 1, 2025-P1-Q1c (10 marks)
Rectangular sheet m; equal squares cut from corners; fold to open box. Find height for maximum volume.
Height ; base . , .
. Only m lies in . : maximum.
Common Traps
- For cylinder-in-sphere: confuse half-height with full height ; the constraint is (not ).
- For cylinder-in-cone: the top circle (not the base) touches the cone wall. Similar triangles give where is measured from the apex, not from the base.
- For the parabola problem: the squared distance collapses to a perfect square — if you expand naively instead of recognising the pattern, you get unnecessary algebra.
critical-point-analysis (1 question(s); 2020)
Recognition Cues
- where is a product of quadratics; “find critical points, local maxima, local minima, zeros on .”
- FTC immediately gives ; the problem reduces to analysing the sign of .
Solution Template
- by FTC. Write out and factor into linear (or simple quadratic) terms.
- Sign table of . Identify all roots; determine the sign of in each interval between roots.
- Classify. Local max at each sign change; local min at each change.
- Zeros of . Compute at all critical points and endpoints; check whether returns to zero.
Worked Example(s)
2020 Paper 1, 2020-P1-Q3a (20 marks)
. (i) critical points; (ii) local minima; (iii) local maxima; (iv) number of zeros on .
(factor each quadratic).
Sign table (alternating from + for ): .
- Local max at (); local min at ().
; (local max); (local min); (local max); (local min); .
Both local minima are , so on .
Common Traps
- With four roots the sign pattern is starting from the left — it alternates at each root. This means and are maxima; and are minima.
- The zero count requires evaluating at the interior minima (not just checking the formula): all minima exceed , so never dips back to zero after .
- by the FTC (lower limit is ), not a critical point of (since ); it is the only zero.
extrema-on-interval (2 question(s); 2018, 2019)
Recognition Cues
- “Find the maximum and minimum of on .” The interval is explicitly closed and bounded.
- The critical point(s) of may or may not lie inside ; endpoints always must be evaluated.
Solution Template
- Find and solve .
- Discard critical points outside .
- Evaluate at all remaining critical points and at and .
- Report the largest value as the maximum and the smallest as the minimum, with their locations.
Worked Example(s)
2019 Paper 1, 2019-P1-Q3a (15 marks)
Find the maximum and minimum of on .
at . On : only (left endpoint) qualifies.
For : (both factors positive), so is strictly increasing.
; .
2018 Paper 1, 2018-P1-Q4a (13 marks)
Find max and min of on .
at . None lie in .
For : , so is increasing on .
; .
Common Traps
- Critical points outside are irrelevant — always check that each critical point lies in the interior before evaluating.
- On a closed interval where doesn’t vanish (e.g. is monotone throughout), the extrema are both at endpoints; no critical-point calculation is needed beyond confirming monotonicity.
- Report the value of at the extremum, not just the location. The question asks for “the maximum value” — giving only without loses marks.
Practice Set
- 2014-P1-Q3a (15 m) — — cylinder-in-sphere: express using the sphere constraint; standard template.
- 2020-P1-Q3a (20 m) — — FTC-defined , four critical points, sign table, zero count — the hardest type in this chapter.