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. /For a whole number n ≥ 1 let S(n) = 1/(n + 1) + 1/(n + 2) + … + 1/2n,; the sum of n fractions…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

For a whole number n ≥ 1 let S(n) = 1/(n + 1) + 1/(n + 2) + … + 1/2n,; the sum of n fractions…

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.

For a whole number n≥1n \ge 1n≥1 let

S(n)=1n+1+1n+2+⋯+12n,\displaystyle S(n) = \dfrac{1}{n + 1} + \dfrac{1}{n + 2} + \dots + \dfrac{1}{2n},S(n)=n+11​+n+21​+⋯+2n1​,

the sum of nnn fractions.

  1. Work out S(2)S(2)S(2) to four decimal places.
  1. Show that S(k+1)−S(k)=12k+1−12k+2S(k + 1) - S(k) = \dfrac{1}{2k + 1} - \dfrac{1}{2k + 2}S(k+1)−S(k)=2k+11​−2k+21​. Be careful: S(k+1)S(k + 1)S(k+1) gains two terms at the end and loses one at the start.
  1. Use (b) and induction to prove that S(n)>1324S(n) > \dfrac{13}{24}S(n)>2413​ for every n≥2n \ge 2n≥2.
  1. Work out S(10)S(10)S(10) to four decimal places.

Say clearly which base case you use, and why the result does not need a separate step for each nnn.

Check your answer

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

Need a reminder? The key ideaShowHide

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). S(2)=13+14=712≈0.5833S(2) = \dfrac{1}{3} + \dfrac{1}{4} = \dfrac{7}{12} \approx 0.5833S(2)=31​+41​=127​≈0.5833.

Step 2. Part (b). S(k+1)−S(k)=12k+1+12k+2−1k+1S(k + 1) - S(k) = \dfrac{1}{2k + 1} + \dfrac{1}{2k + 2} - \dfrac{1}{k + 1}S(k+1)−S(k)=2k+11​+2k+21​−k+11​. Since 1k+1=22k+2\dfrac{1}{k + 1} = \dfrac{2}{2k + 2}k+11​=2k+22​, this is 12k+1−12k+2\dfrac{1}{2k + 1} - \dfrac{1}{2k + 2}2k+11​−2k+21​.

Step 3. Base case for (c). S(2)=712=1424>1324S(2) = \dfrac{7}{12} = \dfrac{14}{24} > \dfrac{13}{24}S(2)=127​=2414​>2413​.

Step 4. The step. Assume S(k)>1324S(k) > \dfrac{13}{24}S(k)>2413​ for some k≥2k \ge 2k≥2. By (b), S(k+1)−S(k)=1(2k+1)(2k+2)>0S(k + 1) - S(k) = \dfrac{1}{(2k + 1)(2k + 2)} > 0S(k+1)−S(k)=(2k+1)(2k+2)1​>0. So S(k+1)>S(k)>1324S(k + 1) > S(k) > \dfrac{13}{24}S(k+1)>S(k)>2413​.

Step 5. Conclusion. By induction, S(n)>1324S(n) > \dfrac{13}{24}S(n)>2413​ for every n≥2n \ge 2n≥2.

Step 6. Part (d). Adding the ten fractions 111\dfrac{1}{11}111​ to 120\dfrac{1}{20}201​ gives S(10)≈0.6688S(10) \approx 0.6688S(10)≈0.6688.

What if? As nnn grows, S(n)S(n)S(n) rises towards ln⁡2≈0.6931\ln 2 \approx 0.6931ln2≈0.6931. Calculus proves that limit.

Answer: S(2)≈0.5833S(2) \approx 0.5833S(2)≈0.5833, S(10)≈0.6688S(10) \approx 0.6688S(10)≈0.6688, and S(n)>1324S(n) > \dfrac{13}{24}S(n)>2413​ for n≥2n \ge 2n≥2.

Log in to save this for later
← All Problems
← Two quantities grow with a whole number n: 3ⁿ and n³…A puzzle asks when the factorial n! = 1 × 2 × … × n overtakes the power 3ⁿ for good… →
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 →

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.