Exercise 6.3 · Q16: Sum 16, least sum of cubes: and
Find two positive numbers whose sum is 16 and the sum of whose cubes is minimum.
Let the numbers be and , where . The sum of their cubes is
gives .
for all , so : is a point of minima.
The numbers are and .
Want the reason behind every step, the basics and the checks?
Write the sum of cubes as a function of one number, , on the range . The cubes cancel when expanded, leaving a quadratic in that opens upward, so there is exactly one lowest point. Calculus finds it, and the sign of the derivative proves it is the least value on the whole range.
- Given
- Two positive numbers with sum 16.
- To find
- The numbers for which the sum of their cubes is least.
- Plan
- Numbers and with ; ; solve ; second derivative test; sign of on the whole range for the global minimum.
Basics you need
Use the sum to write the second number as , and keep both numbers positive. Basics: building the function to optimise
; it turns into a simple product. Basics: factorising
If and , then is a point of local minima. Lesson: derivative tests
Decreasing up to and increasing after means is the least value on the range (Theorem 1, Section 6.3). Lesson: optimisation problems
Solution
One variable and its allowed range
Let one number be ; the other is . Both are positive, so and :
Every allowed pair corresponds to exactly one in . The ends are excluded because "positive" means strictly greater than 0.The sum of cubes
"The sum of whose cubes": cube each number and add.Model first, then differentiate. Basics: building the functionDifferentiate and factorise
Chain rule: . So
is a difference of two squares, with , . Then and , so .Critical point and second derivative test
lies in , and , so by the second derivative test (Theorem 4) is a point of local minima of .
, so its derivative is the constant 96. Positive second derivative means the graph bends upward: a valley.Theorem 4(ii), Section 6.4. Lesson: derivative testsIt is the least value on the whole range
is negative for and positive for . So is decreasing on and increasing on , and for every other allowed .
Expanding confirms it without calculus. Since ,
on : a U-shaped curve, symmetric about , with its lowest point . The open end dots are excluded, so values near 4096 are approached but never reached. The second derivative test is a local statement. The sign of (falling all the way to 8, rising all the way after) is what makes 1024 the least value on the entire range.Answer the question
, and the other number is . The least sum of cubes is .
The question asks for the numbers; the least value is given as a check.
The numbers are 8 and 8; the least possible sum of their cubes is 1024. (Textbook answer: 8, 8.)
, and : all above 1024, and each exceeds 1024 by (for : ). A computer search over finds the least value 1024 at .
- Writing as . The inner function has derivative .
- Expanding wrongly. : here .
- Looking for a maximum as well. On there is none: approaches 4096 near the ends but never reaches it, because 0 is not a positive number.
- For a fixed sum of two positive numbers, the sum of their cubes (like the sum of their squares) is least when the numbers are equal.
- A difference of squares in the derivative often factorises instantly.
- The book's version with squares is Example 22 (sum 15, least sum of squares).
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Writing the quantity in one variable with its range | Steps 1, 2 | Section 6.4, Example 22 (Lesson: optimisation problems) |
| Chain rule; difference of two squares | Step 3 | Chapter 5; algebra (Basics: factorising) |
| Second derivative test | Step 4 | Theorem 4, Section 6.4 (Lesson: derivative tests) |
| Sign of decides increasing or decreasing | Step 5 | Theorem 1 and the Remark after it, Section 6.3 (Lesson: increasing and decreasing) |
| Cube of a difference | Step 5 | Algebra |
| Answer 8, 8 | Result | Answers to Exercise 6.3, Question 16 |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →