Problem:
Let and be non-negative real numbers that sum to . Compute the number of ordered pairs with such that the expression has maximum value .
Problem:
Let and be non-negative real numbers that sum to . Compute the number of ordered pairs with such that the expression has maximum value .
Solution:
Let . Observe that is merely the value of , so this value is always achievable.
We claim (call this result (*)) that if satisfies the condition, so does . To see this, observe that if , then multiplying by the inequality yields , as desired.
For the rest of the solution, without loss of generality we consider the case. If , then , so works. If and , then , so works. For , fails since .
If and , , which is maximized at , so works. However, if and , , which is maximized at . Thus does not work.
From these results and , we are able to deduce all the pairs that do work ( represents those pairs that work by (*)):
