Solution
The answer is only . This works, as for , we have and for , by AM-GM, . We'll now prove that there are no other solutions.
Claim 01. For all , we have
Proof. Let us suppose that the unique satisfying is not . We therefore conclude that and , i.e. and . However, this implies
which is a contradiction. Therefore, we must have for all ; and furthermore for all , we must have
as claimed.
Now, consider the function such that for all . Therefore the condition above rewrites to
f
or any . Let us write this as .
Claim 02. .
Proof. We have for all . Thus,
f
or any , as desired.
This forces , as desired.
|