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. /An engineer adds up the fractions S(n) = 1/(1 × 3) + 1/(3 × 5) + 1/(5 × 7) + … + 1/((2n - 1)(2n +…
AdvancedMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

An engineer adds up the fractions S(n) = 1/(1 × 3) + 1/(3 × 5) + 1/(5 × 7) + … + 1/((2n - 1)(2n +…

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.

An engineer adds up the fractions

S(n)=11×3+13×5+15×7+⋯+1(2n−1)(2n+1)\displaystyle S(n) = \dfrac{1}{1 \times 3} + \dfrac{1}{3 \times 5} + \dfrac{1}{5 \times 7} + \dots + \dfrac{1}{(2n - 1)(2n + 1)}S(n)=1×31​+3×51​+5×71​+⋯+(2n−1)(2n+1)1​

while studying the losses in a long chain of filters.

  1. Work out S(1)S(1)S(1), S(2)S(2)S(2) and S(3)S(3)S(3) as fractions, and guess a formula for S(n)S(n)S(n).
  1. Prove your guess by induction for every n≥1n \ge 1n≥1.
  1. Find S(50)S(50)S(50) to four decimal places.
  1. Find the smallest nnn for which S(n)S(n)S(n) is greater than 0.490.490.49.

In (d), turn the inequality into one for nnn and solve it, then check the answer and the number before it.

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. Small cases. S(1)=13S(1) = \dfrac{1}{3}S(1)=31​. S(2)=13+115=25S(2) = \dfrac{1}{3} + \dfrac{1}{15} = \dfrac{2}{5}S(2)=31​+151​=52​. S(3)=25+135=37S(3) = \dfrac{2}{5} + \dfrac{1}{35} = \dfrac{3}{7}S(3)=52​+351​=73​. We guess S(n)=n2n+1S(n) = \dfrac{n}{2n + 1}S(n)=2n+1n​.

Step 2. Base case. S(1)=13=12+1S(1) = \dfrac{1}{3} = \dfrac{1}{2 + 1}S(1)=31​=2+11​. True.

Step 3. Hypothesis. Assume S(k)=k2k+1S(k) = \dfrac{k}{2k + 1}S(k)=2k+1k​.

Step 4. The step. The next term is 1(2k+1)(2k+3)\dfrac{1}{(2k + 1)(2k + 3)}(2k+1)(2k+3)1​. So

S(k+1)=k(2k+3)+1(2k+1)(2k+3)=(2k+1)(k+1)(2k+1)(2k+3)=k+12k+3,\displaystyle S(k + 1) = \dfrac{k(2k + 3) + 1}{(2k + 1)(2k + 3)} = \dfrac{(2k + 1)(k + 1)}{(2k + 1)(2k + 3)} = \dfrac{k + 1}{2k + 3},S(k+1)=(2k+1)(2k+3)k(2k+3)+1​=(2k+1)(2k+3)(2k+1)(k+1)​=2k+3k+1​,

since 2k2+3k+1=(2k+1)(k+1)2k^2 + 3k + 1 = (2k + 1)(k + 1)2k2+3k+1=(2k+1)(k+1). This is the formula with n=k+1n = k + 1n=k+1. By induction it holds for every n≥1n \ge 1n≥1.

Step 5. Part (c). S(50)=50101≈0.4950S(50) = \dfrac{50}{101} \approx 0.4950S(50)=10150​≈0.4950.

Step 6. Part (d). n2n+1>0.49\dfrac{n}{2n + 1} > 0.492n+1n​>0.49 means n>0.98n+0.49n > 0.98n + 0.49n>0.98n+0.49, so 0.02n>0.490.02n > 0.490.02n>0.49 and n>24.5n > 24.5n>24.5. The smallest whole number is n=25n = 25n=25. Check: S(24)=2449≈0.4898S(24) = \dfrac{24}{49} \approx 0.4898S(24)=4924​≈0.4898 and S(25)=2551≈0.4902S(25) = \dfrac{25}{51} \approx 0.4902S(25)=5125​≈0.4902.

What if? As nnn grows, S(n)S(n)S(n) tends to 12\dfrac{1}{2}21​ but never reaches it.

Answer: S(n)=n2n+1S(n) = \dfrac{n}{2n + 1}S(n)=2n+1n​; S(50)≈0.4950S(50) \approx 0.4950S(50)≈0.4950; the smallest nnn is 252525.

Log in to save this for later
← All Problems
← A student builds towers of small cubes. Tower r is a solid cube with edge r cubes, so it uses r³…A machine passes a signal through a chain of stages… →
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 →

For a sum S(n)=F(n)S(n) = F(n)S(n)=F(n): S(k+1)=S(k)+termk+1=F(k)+termk+1S(k + 1) = S(k) + \text{term}_{k + 1} = F(k) + \text{term}_{k + 1}S(k+1)=S(k)+termk+1​=F(k)+termk+1​ by the hypothesis, and the algebra must give F(k+1)F(k + 1)F(k+1). For a product, multiply by the next factor. Take out common factors early.