Constructive set theory

Why can't you always find the smallest number in a list?

Imagine you're at a party and everyone hands you a different number of candies. You're curious to know who gave you the least amount of candies.

Think of the candies as a collection of numbers. There's always a person who gave you the smallest amount, no matter how many people there are. This idea is guaranteed by a principle in mathematics.

Example

If one person gave you 3 candies, another 7, and a third 2, you can easily spot that the third person gave you the smallest amount.

Remember this

This principle is known as the Well-Ordering Principle, which states that every non-empty set of positive integers has a smallest element.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

The Da Vinci Code (film)

Fibonacci sequence uncovers hidden patterns in nature

Sturm's theorem

Can you always split a polynomial into simpler pieces to find its roots?

Uniform convergence

Ever wondered why some infinite sums add up nicely while others don't?

Alan Turing: The Enigma

Ever wondered why computers can't solve every problem?

Pythagorean theorem

Ever wondered how architects ensure buildings are straight and stable?

Golden ratio

Did you know math shapes our world?

Swipe through 100 ML concepts daily

Open Pocket Polymath