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 claims that, for every whole number n ≥ 1, 1 + 2 + 3 + … + n = ((2n + 1)²)/8.…
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

A student claims that, for every whole number n ≥ 1, 1 + 2 + 3 + … + n = ((2n + 1)²)/8.…

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 claims that, for every whole number n≥1n \ge 1n≥1,

1+2+3+⋯+n=(2n+1)28.\displaystyle 1 + 2 + 3 + \dots + n = \dfrac{(2n + 1)^2}{8}.1+2+3+⋯+n=8(2n+1)2​.

His proof: "Assume it for n=kn = kn=k. Then 1+⋯+k+(k+1)=(2k+1)28+(k+1)=(2k+3)281 + \dots + k + (k + 1) = \dfrac{(2k + 1)^2}{8} + (k + 1) = \dfrac{(2k + 3)^2}{8}1+⋯+k+(k+1)=8(2k+1)2​+(k+1)=8(2k+3)2​, which is the claim for k+1k + 1k+1. So the claim is true for every nnn."

  1. Check the algebra of his step. Is it correct?
  1. Find the error in his proof.
  1. For how many values of nnn from 111 to 100010001000 is the claim true?
  1. By how much does the claimed value differ from the true sum n(n+1)2\dfrac{n(n + 1)}{2}2n(n+1)​?

Explain why a correct step is not enough to make the claim true.

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). (2k+1)2+8(k+1)8=4k2+12k+98=(2k+3)28\dfrac{(2k + 1)^2 + 8(k + 1)}{8} = \dfrac{4k^2 + 12k + 9}{8} = \dfrac{(2k + 3)^2}{8}8(2k+1)2+8(k+1)​=84k2+12k+9​=8(2k+3)2​. The algebra is correct, and 2k+3=2(k+1)+12k + 3 = 2(k + 1) + 12k+3=2(k+1)+1.

Step 2. Part (b). There is no base case. For n=1n = 1n=1 the claim says 1=981 = \dfrac{9}{8}1=89​, which is false.

Step 3. Part (c). (2n+1)2(2n + 1)^2(2n+1)2 is odd, so (2n+1)28\dfrac{(2n + 1)^2}{8}8(2n+1)2​ is never a whole number. The true sum is always a whole number. So the claim is true for 000 values.

Step 4. Part (d). (2n+1)28−n(n+1)2=4n2+4n+1−4n2−4n8=18=0.125\dfrac{(2n + 1)^2}{8} - \dfrac{n(n + 1)}{2} = \dfrac{4n^2 + 4n + 1 - 4n^2 - 4n}{8} = \dfrac{1}{8} = 0.1258(2n+1)2​−2n(n+1)​=84n2+4n+1−4n2−4n​=81​=0.125.

Step 5. Why the step is not enough. The step only says: if the claim is true for kkk, it is true for k+1k + 1k+1. Here it is never true, so the step carries a false statement to another false statement. The error of 18\dfrac{1}{8}81​ is passed along unchanged.

Answer: 000 values; the claim is always 0.1250.1250.125 too big.

Log in to save this for later
← All Problems
← In Pascal's triangle, start at (n, 0) and walk down a diagonal: (n, 0), (n + 1, 1), (n + 2, 2), ……Read this false proof carefully. Claim. For every n ≥ 2: if n lines in the plane are such that no… →
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 →

A valid induction needs a true base case. The step must work for every kkk from the base case on, the smallest kkk too. A step that looks back further needs more base cases. The step ends at P(k+1)P(k + 1)P(k+1) and never starts from it.