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 machine passes a signal through a chain of stages…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A machine passes a signal through a chain of stages…

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 machine passes a signal through a chain of stages. Stage rrr, for r=2,3,4,…r = 2, 3, 4, \dotsr=2,3,4,…, keeps the fraction 1−1r21 - \dfrac{1}{r^2}1−r21​ of the signal it receives. After the stages 222 to nnn the fraction kept is

Q(n)=(1−122)⋯(1−1n2).\displaystyle Q(n) = \left(1 - \dfrac{1}{2^2}\right) \cdots \left(1 - \dfrac{1}{n^2}\right).Q(n)=(1−221​)⋯(1−n21​).
  1. Prove by induction that Q(n)=n+12nQ(n) = \dfrac{n + 1}{2n}Q(n)=2nn+1​ for every n≥2n \ge 2n≥2.
  1. Find the fraction kept after the stages 222 to 100100100, as a decimal.
  1. A designer says that a long enough chain keeps less than half of the signal. Use the formula to say whether this is right.

Note where the base case is, since the product starts at r=2r = 2r=2.

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. Base case. For n=2n = 2n=2: Q(2)=34Q(2) = \dfrac{3}{4}Q(2)=43​ and 2+12×2=34\dfrac{2 + 1}{2 \times 2} = \dfrac{3}{4}2×22+1​=43​. True.

Step 2. Hypothesis. Assume Q(k)=k+12kQ(k) = \dfrac{k + 1}{2k}Q(k)=2kk+1​ for some k≥2k \ge 2k≥2.

Step 3. The step. The next factor is 1−1(k+1)2=(k+1)2−1(k+1)2=k(k+2)(k+1)21 - \dfrac{1}{(k + 1)^2} = \dfrac{(k + 1)^2 - 1}{(k + 1)^2} = \dfrac{k(k + 2)}{(k + 1)^2}1−(k+1)21​=(k+1)2(k+1)2−1​=(k+1)2k(k+2)​. So

Q(k+1)=k+12k×k(k+2)(k+1)2=k+22(k+1).\displaystyle Q(k + 1) = \dfrac{k + 1}{2k} \times \dfrac{k(k + 2)}{(k + 1)^2} = \dfrac{k + 2}{2(k + 1)}.Q(k+1)=2kk+1​×(k+1)2k(k+2)​=2(k+1)k+2​.

This is the formula with n=k+1n = k + 1n=k+1. By induction it holds for every n≥2n \ge 2n≥2.

Step 4. Part (b). Q(100)=101200=0.505Q(100) = \dfrac{101}{200} = 0.505Q(100)=200101​=0.505.

Step 5. Part (c). n+12n=12+12n\dfrac{n + 1}{2n} = \dfrac{1}{2} + \dfrac{1}{2n}2nn+1​=21​+2n1​, which is always more than 12\dfrac{1}{2}21​. The designer is wrong: the fraction kept falls towards one half but never goes below it.

Answer: (b) 0.5050.5050.505; (c) no, the chain always keeps more than half.

Log in to save this for later
← All Problems
← An engineer adds up the fractions S(n) = 1/(1 × 3) + 1/(3 × 5) + 1/(5 × 7) + … + 1/((2n - 1)(2n +…A puzzle book asks for the value of T(n) = 1 × 1! … →
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.