AM ≥ GM ≥ HMJEE Main
The inequality that solves minimum problems — interactive Mathematics simulation for IIT-JEE.
Concept
For positive numbers, the three classical means always stack the same way: AM ≥ GM ≥ HM, with equality only when all numbers are equal. This single inequality is a minimum-finding machine: whenever a product is fixed, the sum is minimised at equality — no calculus needed.
Key formula
Derivation
AM − GM = — a perfect square, zero only at x = y.
HM = GM²/AM (verify: ), so GM is the geometric mean of AM and HM too — the chain follows.
Classic use: , minimum at x = 1.
Scenarios to explore
- AM ≥ GM ≥ HM — The mean inequality chain that solves minimum problems.
Real-world applications
- Minimum of sums with fixed product (fencing, box optimisation).
- Average speed over equal DISTANCES is the harmonic mean.
- Cauchy–Schwarz & power-mean ladders build on it.
JEE exam tips
- a + b + c ≥ 3(abc)^{1/3} — n-term version, same equality condition.
- For min of ax + b/x: split so the product is constant → min = 2√(ab).
- Equality case IS the answer location — always state x = y.
Common mistakes
- Applying AM-GM to negative numbers (needs positives).
- Claiming a minimum without checking equality is ACHIEVABLE in the domain.
- Averaging speeds arithmetically for equal distances (harmonic!).
Exam traps to avoid
- x + 1/x ≥ 2 holds for x > 0 but ≤ −2 for x < 0 — sign matters.
- Weighted AM-GM exists: exam questions sometimes need unequal splits (x = a + a + b style).
