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
  • 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. /A student wants to prove that 1 + 1/2³ + 1/3³ + … + 1/n³ < 3/2; for every n ≥ 1…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A student wants to prove that 1 + 1/2³ + 1/3³ + … + 1/n³ < 3/2; for every n ≥ 1…

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.

A student wants to prove that

1+123+133+⋯+1n3<32\displaystyle 1 + \dfrac{1}{2^3} + \dfrac{1}{3^3} + \dots + \dfrac{1}{n^3} < \dfrac{3}{2}1+231​+331​+⋯+n31​<23​

for every n≥1n \ge 1n≥1. Her first attempt fails: from "the sum up to kkk is less than 32\dfrac{3}{2}23​" she cannot show the same for k+1k + 1k+1.

  1. Explain in one sentence why the direct step fails.
  1. Prove instead, by induction, the stronger claim that the sum up to nnn is at most 32−12n2\dfrac{3}{2} - \dfrac{1}{2n^2}23​−2n21​. In the step, show that 1(k+1)3≤12k2−12(k+1)2\dfrac{1}{(k + 1)^3} \le \dfrac{1}{2k^2} - \dfrac{1}{2(k + 1)^2}(k+1)31​≤2k21​−2(k+1)21​.
  1. For n=10n = 10n=10, give the value of the bound 32−12n2\dfrac{3}{2} - \dfrac{1}{2n^2}23​−2n21​, and the sum itself to four decimal places.

The stronger claim is the key: it carries enough room from one step to the next.

Check your answer

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

Need a reminder? The key ideaShow

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.

Step 1. Part (a). Adding a positive term to a number that is below 32\dfrac{3}{2}23​ can push it past 32\dfrac{3}{2}23​, so the hypothesis gives no room for the new term.

Step 2. Base case of (b). For n=1n = 1n=1: the sum is 111 and 32−12=1\dfrac{3}{2} - \dfrac{1}{2} = 123​−21​=1. So "at most" holds.

Step 3. What the step needs. Assume the sum up to kkk is at most 32−12k2\dfrac{3}{2} - \dfrac{1}{2k^2}23​−2k21​. Adding 1(k+1)3\dfrac{1}{(k + 1)^3}(k+1)31​, we need

1(k+1)3≤12k2−12(k+1)2=(k+1)2−k22k2(k+1)2=2k+12k2(k+1)2.\displaystyle \dfrac{1}{(k + 1)^3} \le \dfrac{1}{2k^2} - \dfrac{1}{2(k + 1)^2} = \dfrac{(k + 1)^2 - k^2}{2k^2(k + 1)^2} = \dfrac{2k + 1}{2k^2(k + 1)^2}.(k+1)31​≤2k21​−2(k+1)21​=2k2(k+1)2(k+1)2−k2​=2k2(k+1)22k+1​.

Step 4. Check it. Multiply both sides by 2k2(k+1)32k^2(k + 1)^32k2(k+1)3: we need 2k2≤(2k+1)(k+1)=2k2+3k+12k^2 \le (2k + 1)(k + 1) = 2k^2 + 3k + 12k2≤(2k+1)(k+1)=2k2+3k+1. That is true for every k≥1k \ge 1k≥1.

Step 5. Conclusion. By induction, the sum up to nnn is at most 32−12n2<32\dfrac{3}{2} - \dfrac{1}{2n^2} < \dfrac{3}{2}23​−2n21​<23​ for every n≥1n \ge 1n≥1.

Step 6. Part (c). The bound is 32−1200=1.495\dfrac{3}{2} - \dfrac{1}{200} = 1.49523​−2001​=1.495. The sum is about 1.19751.19751.1975, well below it.

Answer: the bound for n=10n = 10n=10 is 1.4951.4951.495 and the sum is about 1.19751.19751.1975.

Log in to save this for later
← All Problems
← A puzzle asks when the factorial n! = 1 × 2 × … × n overtakes the power 3ⁿ for good…A games arcade sells tokens worth 4 points and 7 points… →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. Let Pn = 1/2 × 3/4 × 5/6 × … × (2n - 1)/2n…Advanced
  2. A designer draws n straight lines across a large sheet, no two parallel and no three through one…Advanced
  3. An L-shaped piece covers three squares: two side by side and one more next to one of them…Advanced
  4. A student puts n points on a circle and joins every pair by a straight chord, choosing the points…Hard
  5. Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no…Advanced
All problems on this topic →
Hide

An inequality may hold only from some n0n_0n0​ on: check P(n0)P(n_0)P(n0​), then in the step use k≥n0k \ge n_0k≥n0​. Bernoulli: (1+x)n≥1+nx(1 + x)^n \ge 1 + nx(1+x)n≥1+nx for x≥−1x \ge -1x≥−1. If the step fails, try to prove a stronger statement.