Mathematical Elegance Examples: 48 Problems with Answers

Start with the recap, study the fully worked examples, then use the practice problems to check your understanding of Mathematical Elegance.

This page combines explanation, solved examples, and follow-up practice so you can move from recognition to confident problem-solving in Math.

Concept Recap

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

When a proof or solution feels 'just right'—clean, inevitable, illuminating.

Read the full concept explanation →

How to Use These Examples

Read the first worked example with the solution open so the structure is clear.
Try the practice problems before revealing each solution.
Use the related concepts and background knowledge badges if you feel stuck.

What to Focus On

Core idea: Mathematical elegance is an argument or result that reaches its goal with striking simplicity and economy.

Common stuck point: The procedure for mathematical elegance is the easy part; the trap is equating short with elegant. Asking "Does this approach reach the goal with striking simplicity that also illuminates WHY it works?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

Sense of Study hint: Ask: Does this approach reach the goal with striking simplicity that also illuminates WHY it works?

Worked Examples

Example 1

easy

Compare two proofs that

\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?

Answer

Gauss’s pairing: more elegant — one insight, immediate understanding

First step

Proof A (induction): verify

n=1

, assume for

k

, add

(k+1)

to both sides, algebraically verify. Correct but mechanical.

Full solution

2
Proof B (Gauss): write $S = 1+2+\cdots+n$ and $S = n+(n-1)+\cdots+1$ . Add: $2S = n$ copies of $(n+1)$ , so $S = n(n+1)/2$ . One key insight does all the work.
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.

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.

Example 2

medium

Euler's identity

e^{i\pi}+1=0

is often called 'the most beautiful equation in mathematics.' Identify three features that make it elegant.

Example 3

challenge

Find

\sum_{k=0}^{n}\binom{n}{k}

elegantly using a single substitution into

(1+x)^n

Practice Problems

Try these problems on your own first, then open the solution to compare your method.

Example 1

easy

Compare: (A) solving

x^2-5x+6=0

by the quadratic formula, (B) factoring as

(x-2)(x-3)=0

. Which is more elegant?

Example 2

medium

Prove that

\sqrt{2}

is irrational using proof by contradiction. Identify the elegant core of the argument.

Example 3

easy

To add

1+2+3+\cdots+100

, Solution A adds term by term; Solution B pairs

1+100, 2+99, \dots

into

50

pairs of

101

. Which is more elegant?

Example 4

easy

Prove

n^2 - n

is even. Solution A checks many values; Solution B notes

n^2-n=n(n-1)

, a product of consecutive integers. Which is elegant?

Example 5

easy

Which expression for the same line is simpler:

y = 2x + 3

y = \frac{4x+6}{2}

Example 6

easy

To show

\frac{2}{4}=\frac{1}{2}

, Solution A draws pictures of pizzas; Solution B divides numerator and denominator by

2

. Which is more economical?

Example 7

easy

Both proofs of 'the sum of two evens is even' are correct. One writes

2a+2b=2(a+b)

; the other tests

2+4, 6+8, \dots

. Which proves it?

Example 8

easy

Which is the more elegant value of

\cos 60^\circ

to report:

0.5

\frac{1}{2}

in an exact context?

Example 9

easy

To find the area of a

3

4

5

right triangle, Solution A uses Heron's formula; Solution B uses

\frac{1}{2}(3)(4)

. Which is simpler?

Example 10

easy

Which proof that

\sqrt{2}

is irrational is more elegant: a long decimal expansion attempt, or a short contradiction argument?

Example 11

medium

Two correct solutions find

1+3+5+\cdots+(2n-1)

. One sums step by step; one recognizes it equals

n^2

. Which is more elegant and why?

Example 12

medium

To prove the medians of a triangle concur, Solution A uses messy coordinate algebra; Solution B places the centroid at

\frac{A+B+C}{3}

with vectors. Which is more elegant and why?

Example 13

medium

A solution to '

\gcd(a,b)\cdot\text{lcm}(a,b)=ab

' lists prime factorizations cleanly. A rival memorizes a special case. Why is the general factorization argument more elegant?

Example 14

medium

Computing

99^2

: Solution A multiplies

99\times 99

longhand; Solution B uses

(100-1)^2=10000-200+1

. Which is more economical and what is the value?

Example 15

medium

Which solution to 'sum of interior angles of an

n

-gon' is more elegant: measuring many polygons, or triangulating into

(n-2)

triangles?

Example 16

medium

A proof uses 8 lines but each step is justified; a rival is 3 lines but skips a key justification. Which is more elegant, given elegance requires correctness?

Example 17

medium

To show

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

, one writes the sum forward and backward and adds. Why is this 'reversal' trick considered elegant?

Example 18

medium

Which is the more elegant way to express the answer

\frac{\sqrt{8}}{2}

: leave it, or simplify to

\sqrt{2}

Example 19

medium

To prove two triangles congruent, Solution A measures all six parts; Solution B cites SAS from two sides and the included angle. Why is B more elegant?

Example 20

challenge

Two valid proofs that infinitely many primes exist: Euclid's (assume finite, form

p_1\cdots p_n+1

) versus a long sieve-counting estimate. Which is more elegant and why?

Example 21

challenge

Evaluating

\frac{1}{1\cdot2}+\frac{1}{2\cdot3}+\cdots+\frac{1}{n(n+1)}

: a brute sum vs telescoping via

\frac{1}{k}-\frac{1}{k+1}

. Give the elegant value and why telescoping wins.

Example 22

challenge

A student offers a 'slick' one-liner for

\sum k^2

but it gives the wrong constant; a careful induction is longer but correct. Reconcile this with 'elegance requires correctness.'

Example 23

easy

To compute

25 \cdot 16

, one student does long multiplication; another rewrites it as

100 \cdot 4

. Which is more elegant, and what is the value?

Example 24

easy

Which form of the answer is more elegant for

x = \frac{10}{\sqrt{2}}

: leave as is, or rationalize?

Example 25

easy

A proof of '

0\cdot a = 0

' takes two lines using

0\cdot a = (0+0)a = 0\cdot a + 0\cdot a

. Why is this proof elegant?

Example 26

easy

To show two lines are parallel, one student calculates many points; another compares slopes. Which approach is more elegant?

Example 27

easy

To check

11 \cdot 13 = 143

, a student notices

(12-1)(12+1) = 144-1 = 143

. Why is this elegant?

Example 28

easy

Compute

99 \cdot 101

elegantly.

Example 29

medium

Evaluate

\sum_{k=1}^{100} (2k-1)

using the most elegant identity.

Example 30

medium

Evaluate

\sum_{k=1}^{n} \left(\tfrac{1}{k}-\tfrac{1}{k+1}\right)

by telescoping.

Example 31

medium

Solve

x^4 - 5x^2 + 4 = 0

elegantly by substitution.

Example 32

medium

To show

\sum_{k=1}^{n} k^3 = \left(\sum_{k=1}^{n} k\right)^2

, which approach is most elegant: brute induction or a visual square-of-staircase argument?

Example 33

medium

To prove a triangle inequality

a+b>c

, which is more elegant: SSS coordinate brute-force or the triangle-inequality axiom for metrics?

Example 34

medium

Two proofs of '

\binom{n}{k} = \binom{n}{n-k}

': algebraic with factorials, or combinatorial (pick the

k

to include vs the

n-k

to exclude). Which is more elegant and why?

Example 35

medium

Evaluate

\int_{-a}^{a} x^{3} \cos(x^2)\,dx

elegantly.

Example 36

medium

Two proofs that the diagonal of a unit square has irrational length: a long decimal argument vs. assume

\sqrt{2}=\frac{p}{q}

in lowest terms and derive contradiction. Which is elegant?

Example 37

medium

To compute

\binom{10}{2}+\binom{10}{3}

, which is more elegant: direct computation, or Pascal's rule giving

\binom{11}{3}

Example 38

medium

Compute

\gcd(1001, 1330)

elegantly using the Euclidean algorithm.

Example 39

hard

To prove there is no largest prime, contrast Euclid's '

p_1\cdots p_n + 1

' with checking primes one at a time. Why is Euclid's proof elegant?

Example 40

hard

Solve

x^2+y^2 = 2xy

over the reals elegantly.

Example 41

hard

Compute

\sum_{k=1}^{n} k \binom{n}{k}

elegantly.

Example 42

hard

Evaluate

\prod_{k=2}^{n}\left(1-\tfrac{1}{k^2}\right)

elegantly.

Example 43

hard

To prove '

\sqrt{2}+\sqrt{3}

is irrational,' which is more elegant: assume rationality and square twice, or test decimal approximations?

Example 44

hard

For a chessboard with two opposite corners removed (62 squares), prove no domino tiling exists elegantly.

Example 45

challenge

Among two proofs of the AM-GM inequality

\tfrac{a+b}{2}\ge\sqrt{ab}

for

a,b\ge 0

: (A) expanding

(\sqrt{a}-\sqrt{b})^2 \ge 0

, (B) calculus optimization. Which is more elegant and why?

← Back to Mathematical Elegance Formula Explained Practice Mode

Related Concepts

Abstraction Structure Recognition

Background Knowledge

These ideas may be useful before you work through the harder examples.

abstractionstructure recognition