Sums, recurrences and induction

Sign up free to unlock this topic

Kindergarten is free, and guests can try one sample topic in every other grade. A free parent or teacher account opens every topic from Kindergarten to Grade 12, college and university, and saves progress. No credit card.

Try the free sample: The ideal gas law · Have a class or homeroom code? Join here

Key idea: Sums, recurrences and induction

Closed formulas replace long sums: 1 + 2 + … + n = n(n + 1) ÷ 2, and the sum of squares is n(n + 1)(2n + 1) ÷ 6. A recurrence defines each term from earlier ones; induction proves a formula for every n.

Key words

Induction
Base case, then n → n + 1.
Recurrence
aₙ from aₙ₋₁.

🔎 What to look for: Check a formula on n = 1 and n = 2 before trusting it.

Zero2Hero — Zéro2Héros