Let be positive real numbers. Find the minimum value of
Change variables to expose the constraint. Put , , , so that automatically. Then
Guess the equality case. Taking gives and The rest of the work is proving no configuration beats this.
Step down through the sum of squares. By the power-mean inequality applied to , So it suffices to show . (The tempting shortcut is simply false — gives — so the squares, not the first powers, are the right quantity to bound.)
Use a two-variable lemma. For all , because clearing denominators leaves the identity .
Apply it with . The lemma gives , so
Combine and confirm. Therefore with equality exactly when and , i.e. . A numerical global search over random restarts also bottoms out at with .
Need to solve a different problem like this? Open the solver →