3.3.5 · D3Sequences & Series

Worked examples — AM-GM-HM inequalities — proofs

2,322 words11 min readBack to topic

This page is a drill. The parent note proved the chain . Here we take that proven fact and throw every kind of question at it — so that when an exam or a real problem hands you a case, you have already seen its twin.

Before any symbol appears in an example, here is the vocabulary, in plain words:

  • Positive real means a number bigger than zero (like , , ) — never zero, never negative. AM–GM only works here (the parent note's first mistake box shows why).
  • AM = add them, divide by how many. GM = multiply them, take the root.
  • HM = flip each number, average the flips, flip back. In symbols, for positive numbers : . For this simplifies to ; for all-equal to it gives . Same formula, any — that's why the 2-term and 3-term versions agree.
  • "Equality condition" = the exact situation where the two sides are equal, not just . For all three means that situation is: all the numbers are equal.

The scenario matrix

Every question this topic can ask falls into one of these cells. Each worked example below is tagged with the cell it lands in, and together they fill the whole grid.

Cell Case class What makes it tricky Example
C1 Two positives, plain AM≥GM nothing — the warm-up Ex 1
C2 Product fixed → minimise a sum you must spot the constant product Ex 2
C3 Sum fixed → maximise a product the mirror image of C2 Ex 3
C4 Three-variable symmetric inequality apply AM–GM in pieces, multiply Ex 4
C5 HM word problem (rates / equal distances) knowing why HM, not AM Ex 5
C6 Degenerate: all numbers equal equality case — everything collapses Ex 6
C7 Limiting / boundary: one number GM and HM crash toward Ex 7
C8 The trap: negative inputs AM–GM breaks — recognise & refuse Ex 8
C9 Exam twist: weighted / non-obvious split rig the terms so the product is constant Ex 9

Ex 1 — Two positives, the raw inequality (Cell C1)


Ex 2 — Fixed product, minimise a sum (Cell C2)


Ex 3 — Fixed sum, maximise a product (Cell C3)


Ex 4 — Three-variable symmetric inequality (Cell C4)


Ex 5 — HM word problem, equal distances (Cell C5)


Ex 6 — Degenerate case: all numbers equal (Cell C6)


Ex 7 — Limiting behaviour: one input heads to zero (Cell C7)


Ex 8 — The forbidden case: negative inputs (Cell C8)


Ex 9 — Exam twist: rig the split so the product is constant (Cell C9)


Recall

Recall Which cell is which?

Fixed product, minimise sum ::: Cell C2 (Ex 2) — bound sum from below. Fixed sum, maximise product ::: Cell C3 (Ex 3) — bound product from above. Equal-distance average speed ::: Cell C5 (Ex 5) — it's the HM, always AM. Why can't AM–GM take ? ::: aren't real; the proof's collapses (Ex 8). Trick when the product isn't constant ::: split a term into equal pieces until it is (Ex 9). Only case with AM=GM=HM ::: all numbers equal (Ex 6).

Related: Optimization using inequalities · Weighted Means (Power Mean Inequality) · Cauchy-Schwarz Inequality · Jensen's Inequality · Harmonic Progression.