Recursion, Induction, and Why My Brain Likes Both

Abstract representation of recursive structure

Mathematical induction is the proof technique that says: if it works for n=1n=1 and nn+1n \Rightarrow n+1, it works everywhere. Recursion is induction's impatient twin who wants the answer now.

The sum of the first nn positive integers:

i=1ni=n(n+1)2\sum_{i=1}^{n} i = \frac{n(n+1)}{2}

Inline math works too: E=mc2E = mc^2 is overrated; O(nlogn)O(n \log n) is where the real drama lives.