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. /In Pascal's triangle, start at (n, 0) and walk down a diagonal: (n, 0), (n + 1, 1), (n + 2, 2), ……
HardMathematicsHigh School (11–12)Mathematical InductionNumericalConceptualOlympiadWBJEE
+2 more exams
A-LevelIB
OlympiadA-LevelIB

In Pascal's triangle, start at (n, 0) and walk down a diagonal: (n, 0), (n + 1, 1), (n + 2, 2), ……

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.

In Pascal's triangle, start at (n0)\binom{n}{0}(0n​) and walk down a diagonal: (n0),(n+11),(n+22),…,(n+kk)\binom{n}{0}, \binom{n + 1}{1}, \binom{n + 2}{2}, \dots, \binom{n + k}{k}(0n​),(1n+1​),(2n+2​),…,(kn+k​). The sum of these k+1k + 1k+1 numbers is a single entry of the triangle:

(n0)+(n+11)+⋯+(n+kk)=(n+k+1k).\displaystyle \binom{n}{0} + \binom{n + 1}{1} + \dots + \binom{n + k}{k} = \binom{n + k + 1}{k}.(0n​)+(1n+1​)+⋯+(kn+k​)=(kn+k+1​).
  1. Check the identity for n=2n = 2n=2 and k=2k = 2k=2.
  1. Prove it by induction on kkk, for a fixed n≥0n \ge 0n≥0. Use Pascal's rule in the step.
  1. Find (30)+(41)+(52)+(63)+(74)\binom{3}{0} + \binom{4}{1} + \binom{5}{2} + \binom{6}{3} + \binom{7}{4}(03​)+(14​)+(25​)+(36​)+(47​) with the identity.

Say clearly which letter the induction runs over, since there are two.

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). (20)+(31)+(42)=1+3+6=10\binom{2}{0} + \binom{3}{1} + \binom{4}{2} = 1 + 3 + 6 = 10(02​)+(13​)+(24​)=1+3+6=10, and (52)=10\binom{5}{2} = 10(25​)=10.

Step 2. Base case. The induction runs over kkk, with nnn fixed. For k=0k = 0k=0: (n0)=1=(n+10)\binom{n}{0} = 1 = \binom{n + 1}{0}(0n​)=1=(0n+1​).

Step 3. Hypothesis. Assume the sum up to (n+kk)\binom{n + k}{k}(kn+k​) is (n+k+1k)\binom{n + k + 1}{k}(kn+k+1​).

Step 4. The step. Add the next term (n+k+1k+1)\binom{n + k + 1}{k + 1}(k+1n+k+1​):

(n+k+1k)+(n+k+1k+1)=(n+k+2k+1),\displaystyle \binom{n + k + 1}{k} + \binom{n + k + 1}{k + 1} = \binom{n + k + 2}{k + 1},(kn+k+1​)+(k+1n+k+1​)=(k+1n+k+2​),

by Pascal's rule. This is the identity with k+1k + 1k+1 in place of kkk.

Step 5. Conclusion. By induction on kkk, the identity holds for every k≥0k \ge 0k≥0.

Step 6. Part (c). Here n=3n = 3n=3 and k=4k = 4k=4, so the sum is (84)=70\binom{8}{4} = 70(48​)=70. Check: 1+4+10+20+35=701 + 4 + 10 + 20 + 35 = 701+4+10+20+35=70.

Answer: 707070.

Log in to save this for later
← All Problems
← Let z = cosπ/12 + i sinπ/12. Prove De Moivre's theorem, (cosθ + i sinθ)ⁿ = cos nθ + i sin nθ, by…A student claims that, for every whole number n ≥ 1, 1 + 2 + 3 + … + n = ((2n + 1)²)/8.… →
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 →

Matrix powers: guess AnA^nAn from A2A^2A2 and A3A^3A3, then prove with Ak+1=AkAA^{k + 1} = A^kAAk+1=AkA. nth derivatives: differentiate the formula for kkk once more. Pascal's rule (kr−1)+(kr)=(k+1r)\binom{k}{r - 1} + \binom{k}{r} = \binom{k + 1}{r}(r−1k​)+(rk​)=(rk+1​) carries binomial results from kkk to k+1k + 1k+1.