Nesbitt's inequality
From Wikipedia, the free encyclopedia
|
In mathematics, Nesbitt's inequality is a special case of the Shapiro inequality. It states that for positive real numbers a, b and c we have:
ProofFirst proofStarting from Nesbitt's inequality(1903)
we transform the left hand side:
Now this can be transformed into:
Division by 3 and the right factor yields:
Now on the left we have the arithmetic mean and on the right the harmonic mean, so this inequality is true. We might also want to try to use GM for three variables. Second proofSuppose Failed to parse (Missing texvc executable; please see math/README to configure.): a \ge b \ge c , we have that
define
The scalar product of the two sequences is maximum because of the Rearrangement inequality if they are arranged the same way, call Failed to parse (Missing texvc executable; please see math/README to configure.): \vec y_1 and Failed to parse (Missing texvc executable; please see math/README to configure.): \vec y_2 the vector Failed to parse (Missing texvc executable; please see math/README to configure.): \vec y shifted by one and by two, we have:
NoteThis article incorporates material from Nesbitt's inequality on PlanetMath, which is licensed under the GFDL. This article incorporates material from proof of Nesbitt's inequality on PlanetMath, which is licensed under the GFDL.fi:Nesbittin epäyhtälö vi:Bất đẳng thức Nesbitt |


