Processing math: 100%
ThmDex – An index of mathematical definitions, results, and conjectures.
Tight upper bound to a finite product of unsigned real numbers
Formulation 0
Let x1,,xN[0,) each be an D4767: Unsigned real number.
Then
(1) Nn=1xn(1NNn=1xn)N
(2) Nn=1xn=(1NNn=1xn)Nx1=x2==xN
Subresults
R5211: Tight upper bound to a product of three unsigned real numbers
R5210: Tight upper bound to a product of two unsigned real numbers
R5183: Unique global maximizer for a finite product of unsigned real numbers with a given sum
Proofs
Proof 0
Let x1,,xN[0,) each be an D4767: Unsigned real number.
This result is a particular case of R3568: Real AM-GM inequality.