AM-GM Proof

Prove, where a i are positive integers for all positive integers i :

Pn s
n
i =1 a i Y
≥ n ai
n i =1

Solution: (Proof by induction)

We first establish two base cases, where n = 1, 2. When n = 1, both means then equal a 1 , so our
inequality is a 1 ≥ a 1 , which is trivially true.
a1 + a2 p
When n = 2, we have ≥ a 1 a 2 , which follows from the fact that all squares of real numbers
2
are non-negative.

We will have two inductive steps: if n = k is assumed to be true, we show that n = 2 k is also true,
and that n = k − 1 is true.
Pk
i =1 a i
qQ
k k
We assume that the inequality is true for n = k: ≥ i =1 a i . Then we need to show that
P2k k
i =1 a i
q
2 k Q2k

2k
≥ i =1 a i .
But from our assumption, we have
v
Pk u
k
i =1 a i
u
k
Y
≥ t ai
k i =1
v
P2k u 2k
i = k+1 i
a u k
Y
≥t ai
k i = k+1

But
Pk P2k
i =1 a i i = k+1
ai
P2k +
i =1 a i k k
=
2k s 2
Pk P2k
i =1 a i ai ■+■ p
µ ¶
i = k+1
≥ ≥ ■■, by AM-GM, n = 2
k k 2
vv v
uu
uu k u 2k
utk
Y u k
Y
≥t ai t ai
i =1 i = k+1
v
2k
u
u
k
2t
Y
= ai.
i =1

Thus the statement is true for n = 2 k.

p.1 njb
 AM-GM Proof

Pk−1
i =1 ai k−1
qQ
k−1
Next, we show that the statement is true for n = k − 1; i.e., ≥ i =1 a i . We start with our
Pk−1 k−1
ai
assumption, that n = k is true, and let a k = i=1 . Then we have
k−1
v
Pk Pk−1 u
k
i =1 a i i =1 ai + ak u
k
Y
= ≥t a i
k k i =1
Pk−1
Pk−1 i =1 ai v
ai + kX
−1
u
k
1 k
µ ¶
i =1 k−1 =
u
k
Y
⇒ ai · ≥t a i
k i =1 k k−1 i =1
v
Pk−1 u
k
i =1 a i
u
k
Y
⇒ ≥ t ai
k−1 i =1
v
k
u
u
k
Y
⇒ ak ≥ t ai
i =1
k
a kk ≥
Y
⇒ ai
i =1
kY−1
⇒ a kk−1 ≥ ai
i =1
v
kY
−1
u
u
k−t
1
⇒ ak ≥ ai
i =1
v
Pk−1 u
kY −1
a
i =1 i
u
k−t
1
⇒ ≥ ai.
k−1 i =1

And we are done.

p.2 njb