@openstem shared this note

Mathematics · L3 · Mathematical Induction

The base case and inductive step that make up a proof by induction, a full worked proof that 1 + 2 + ... + n = n(n+1)/2, why neither step alone is enough, and the domino intuition for why the method works.

Mathematics
Updated
0
0
Read only
Browse Mathematics

We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy