Consider functions that satisfy for all real numbers and . Of all such functions that also satisfy the equation , what is the greatest possible value of
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Use f(300) = f(900) as a shortcut: |f(800) − f(400)| ≤ 50 + 50 = 100, then halve once more for 50, attained by a piecewise-linear f.
Solution
Upper bound. Applying the condition to the outer ,
Now bound using the equal values at and :
Hence the target is at most .
Construction. Equality needs , , and slope exactly between the two inner values. Take , so and , and make have slope on . One piecewise-linear choice, with every slope of absolute value at most :
extended by constants outside . It is continuous (check the joints: ) and satisfies the condition. Then .
The answer is .
Why this works
A contraction with factor shrinks every gap by half, and composing it shrinks again. The hidden ingredient is , which lets you travel from to through a shortcut of total length instead of . Maximum-value problems then demand a construction: piecewise-linear functions with slopes and are the standard way to make every inequality tight.
The trap
Bounding |f(800) − f(400)| by ½·400 = 200 directly (ignoring f(300) = f(900)) and answering 100.
Common mistakes
- Bounding |f(800) − f(400)| by ½·400 = 200 directly (ignoring f(300) = f(900)) and answering 100.
- Stopping at the bound without checking it is attainable, or trying a symmetric like , which forces and gives .
Techniques
Bound the quantity above/below or estimate to pin it down