6 methods · 11 questions
★ Signature method unlocked: the technique this chapter rewards most often, with 3 worked questions.
The full chapter (6 methods · 11 worked questions) comes with Platform Access. See pricing
A maximum-area or shortest-distance question is solved by turning the geometry into a single-variable function. Pick one free variable, use the geometric constraint to eliminate every other variable, write the target quantity as a function of that one variable, and set its derivative to zero.
Trigger: 'maximum possible volume/area' or 'minimum distance' with a curve or region.
Instances:
(i) use the given volume to substitute for one dimension, leaving the surface area as a function of one variable to differentiate;
(ii) express coordinates of a rectangle's vertices in terms of a single parameter p to write the area as A(p);
(iii) to find the maximum or minimum of a vertical distance, write the difference in y-coordinates as a function of x and set its derivative to zero.
Linked questions (3)
NSAA 2018 Section 1, Part E (Mathematics questions) · Q89
Answer:C
ENGAA 2016 Section 1, Part B (Mathematics questions) · Q49
Answer:B
ENGAA 2021 Section 1, Part B (Mathematics questions) · Q39

Answer:B
