Mathematical Elegance Math Example 1

Follow the full solution, then compare it with the other examples linked below.

Example 1

easy
Compare two proofs that ∑k=1nk=n(n+1)2\sum_{k=1}^{n}k = \frac{n(n+1)}{2}: (A) direct algebraic induction, (B) Gauss's pairing argument. Which is more elegant and why?

Solution

  1. 1
    Proof A (induction): verify n=1n=1, assume for kk, add (k+1)(k+1) to both sides, algebraically verify. Correct but mechanical.
  2. 2
    Proof B (Gauss): write S=1+2+⋯+nS = 1+2+\cdots+n and S=n+(n−1)+⋯+1S = n+(n-1)+\cdots+1. Add: 2S=n2S = n copies of (n+1)(n+1), so S=n(n+1)/2S = n(n+1)/2. One key insight does all the work.
  3. 3
    Elegance assessment: Proof B is more elegant — it uses a single creative insight (pairing) that explains why the formula holds, not just that it holds.

Answer

Gauss’s pairing: more elegant — one insight, immediate understanding\text{Gauss's pairing: more elegant — one insight, immediate understanding}
An elegant proof achieves its goal with minimal steps, reveals the reason behind the result, and often uses a surprising or beautiful insight. Elegance is not just aesthetic — elegant proofs tend to be more memorable and generalisable.

About Mathematical Elegance

The aesthetic quality of a mathematical argument or result that achieves its goal with striking simplicity, insight, or economy of means.

Learn more about Mathematical Elegance →

More Mathematical Elegance Examples

Example 2 medium

Euler's identity [formula] is often called 'the most beautiful equation in mathematics.' Identify th

Example 3 easy

Compare: (A) solving [formula] by the quadratic formula, (B) factoring as [formula]. Which is more e

Example 4 medium

Prove that [formula] is irrational using proof by contradiction. Identify the elegant core of the ar

← All Mathematical Elegance Examples Mathematical Elegance Concept