Gauss, Triangular Numbers, and Induction

Gauss's Trick for 1..100

Gauss paired the numbers from 1 to 100: pair each i with (101 − i). This creates 50 pairs, each summing to 101, giving a total of 50×101=505050 \times 101 = 5050. Generalizing, for even n, ∑i=1ni=n(n+1)2\sum_{i=1}^n i = \frac{n(n+1)}{2}
Each pair sums to n+1 and there are n/2 pairs.

Triangular Numbers

A triangular number is the sum of the first n natural numbers: T<em>n=∑</em>i=1ni=n(n+1)2.T<em>n = \sum</em>{i=1}^n i = \frac{n(n+1)}{2}.
First values: T<em>1=1,T</em>2=3,T<em>3=6,T</em>4=10,T5=15,…T<em>1=1, T</em>2=3, T<em>3=6, T</em>4=10, T_5=15,\dots
This quantity also counts dots in a triangular arrangement and is the nth triangular number.

Sum of Odd Numbers Equals a Square

The sum of the first n odd numbers is a perfect square: 1+3+5+⋯+(2n−1)=n2.1+3+5+\cdots +(2n-1) = n^2.
Derivation via total minus evens: sum 1..2n is 2n(2n+1)2=n(2n+1)\frac{2n(2n+1)}{2}=n(2n+1), sum of evens is 2(1+2+⋯+n)=n(n+1)2(1+2+\cdots +n)=n(n+1), so difference gives n2n^2.

Natural Numbers and Induction

Natural numbers are typically taken as starting at 1 (some definitions include 0). The Principle of Mathematical Induction:

  • Define a property P(n) about natural number n.

  • Base case: P(1) is true.

  • Inductive step: If P(k) is true, then P(k+1) is true.

  • Conclusion: P(n) holds for all natural numbers n.
    This requires clear base case and a valid inductive step to transfer truth from k to k+1.

Inductive Proof: Sum of First n Numbers

Goal: Prove ∑i=1ni=n(n+1)2.\sum_{i=1}^n i = \frac{n(n+1)}{2}.

Base case (n=1): 1=1(1+1)21=\frac{1(1+1)}{2} holds.

Inductive step: Assume for some k that ∑<em>i=1ki=k(k+1)2.\sum<em>{i=1}^k i = \frac{k(k+1)}{2}.. Then ∑</em>i=1k+1i=k(k+1)2+(k+1)=(k+1)(k+2)2,\sum</em>{i=1}^{k+1} i = \frac{k(k+1)}{2} + (k+1) = \frac{(k+1)(k+2)}{2},
which is the desired form for n = k+1. Hence, by induction, the formula holds for all natural numbers n.

Alternative Perspectives (Brief)

  • Gauss's trick can be viewed as a double-counting/pattern-recognition method.

  • The odd/even decomposition provides another route to the same triangular-number result.

  • In proofs, clearly state the base case and the inductive hypothesis, and show the inductive step.

Quick Takeaways

  • Core formulas:

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

    • Tn=n(n+1)2T_n = \frac{n(n+1)}{2}

    • ∑i=1n(2i−1)=n2\sum_{i=1}^n (2i-1) = n^2

  • Induction structure: base case + inductive step => holds for all natural numbers.

  • Gauss’s trick is a foundational example of pattern recognition leading to a general formula.