HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Here is a statement that many olympiad solutions use…
AdvancedMathematicsHigh School (11–12)Inequalities and the AM, GM and HM MeansConceptualNumericalOlympiad

Here is a statement that many olympiad solutions use…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Here is a statement that many olympiad solutions use.

Claim. If x1,x2,…,xnx_1, x_2, \dots, x_nx1​,x2​,…,xn​ are positive and x1x2⋯xn=1x_1 x_2 \cdots x_n = 1x1​x2​⋯xn​=1, then x1+x2+⋯+xn≥nx_1 + x_2 + \dots + x_n \ge nx1​+x2​+⋯+xn​≥n, with equality only when every xi=1x_i = 1xi​=1.

  1. Prove the claim by induction on nnn, without quoting AM-GM. For the step, choose two of the numbers, one at least 111 and one at most 111, and use the fact that (x1−1)(x2−1)≤0(x_1 - 1)(x_2 - 1) \le 0(x1​−1)(x2​−1)≤0 for such a pair.
  1. Use the claim to prove AM-GM itself: apply it to xi=aiGx_i = \dfrac{a_i}{G}xi​=Gai​​, where GGG is the geometric mean of positive a1,…,ana_1, \dots, a_na1​,…,an​.
  1. Five positive numbers have product 323232. Find the least possible value of their sum and the least possible value of the sum of their squares.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

For positive numbers the means come in a fixed order, with equality only when all the numbers are equal:

a1+⋯+ann ≥ a1⋯ann ≥ n1a1+⋯+1an.\displaystyle \dfrac{a_1 + \dots + a_n}{n} \ \ge\ \sqrt[n]{a_1 \cdots a_n} \ \ge\ \dfrac{n}{\frac{1}{a_1} + \dots + \frac{1}{a_n}}.na1​+⋯+an​​ ≥ na1​⋯an​​ ≥ a1​1​+⋯+an​1​n​.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Given. Positive numbers with product 111.

Plan. Merge two numbers into one, use the induction hypothesis, and add back what was lost.

Step 1. The base case. For n=1n = 1n=1 the only number is x1=1x_1 = 1x1​=1, and the sum is 111.

Step 2. The induction step. Suppose the claim holds for n−1n - 1n−1 numbers, and take nnn numbers with product 111. If all are 111, the sum is nnn. Otherwise one is above 111 and one is below 111; call them x1x_1x1​ and x2x_2x2​. Then (x1−1)(x2−1)<0(x_1 - 1)(x_2 - 1) < 0(x1​−1)(x2​−1)<0, which expands to x1+x2>1+x1x2x_1 + x_2 > 1 + x_1 x_2x1​+x2​>1+x1​x2​.

Step 3. Merge. The n−1n - 1n−1 numbers x1x2,x3,…,xnx_1 x_2, x_3, \dots, x_nx1​x2​,x3​,…,xn​ have product 111. By the hypothesis their sum is at least n−1n - 1n−1. So

x1+x2+x3+⋯+xn>1+x1x2+x3+⋯+xn≥1+(n−1)=n.\displaystyle x_1 + x_2 + x_3 + \dots + x_n > 1 + x_1 x_2 + x_3 + \dots + x_n \ge 1 + (n - 1) = n.x1​+x2​+x3​+⋯+xn​>1+x1​x2​+x3​+⋯+xn​≥1+(n−1)=n.

The inequality is strict unless every number is 111. This completes the induction.

Step 4. AM-GM. Put xi=aiGx_i = \dfrac{a_i}{G}xi​=Gai​​. Their product is a1⋯anGn=1\dfrac{a_1 \cdots a_n}{G^n} = 1Gna1​⋯an​​=1. So ∑aiG≥n\sum \dfrac{a_i}{G} \ge n∑Gai​​≥n, which is a1+⋯+ann≥G\dfrac{a_1 + \dots + a_n}{n} \ge Gna1​+⋯+an​​≥G.

Step 5. Five numbers. The geometric mean is 325=2\sqrt[5]{32} = 2532​=2, so the sum is at least 5×2=105 \times 2 = 105×2=10. The squares have product 322=102432^2 = 1024322=1024 and geometric mean 444, so their sum is at least 5×4=205 \times 4 = 205×4=20. Both bounds are reached when every number is 222.

Answer: proof as above; the least sum is 101010 and the least sum of squares is 202020. Proof complete.

Log in to save this for later
← All Problems
← A delivery rider travels from a depot to a market and back along the same road, a distance of 36 km…A company has a budget that it splits between advertising and research… →
More onInequalities and the AM, GM and HM Means

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Arithmetic, geometric and harmonic meansThe AM-GM-HM Inequality and Power Means

More on this topic

  1. The equation x⁴ - 12x³ + ax² - bx + 81 = 0; has four positive real roots…Advanced
  2. Nine houses stand along a straight road at the marks 1, 2, 3, …, 9 km…Hard
  3. Real numbers x, y and z satisfy x + y + z = 5 and xy + yz + zx = 3.…Hard
  4. Real numbers x and y satisfy x² + xy + y² = 3.…
Advanced
  • Schur's inequality says that for non-negative a, b, c, a(a - b)(a - c) + b(b - a)(b - c) + c(c…Advanced
  • All problems on this topic →