Fun with Math – Interesting Facts About Numbers and Maths Discoveries
Table of Contents
- 1. The Origin of Zero
- 2. Pi (π) Is Older Than You Think
- 3. Fibonacci Sequence in Nature
- 4. Pythagoras and His Theorem
- 5. The Mystery of Prime Numbers
- 6. The Magic of 1089
- 7. The Largest Known Prime Number
- 8. Mathematicians and Cake
- 9. Math and Ancient Egyptians
- 10. Numbers with Names
- 11. The Curious Case of 1
- 12. Pascal’s Triangle
The Origin of Zero
Did you know that “zero” is one of the youngest ideas in mathematics? Ancient civilisations counted, measured, and even did algebra for thousands of years without a true zero. It was finally formalised in India around 628 CE by the mathematician Brahmagupta, in his book Brahmasphutasiddhanta. The word “zero” itself descends from the Sanskrit śūnya, meaning “empty,” which travelled through Arabic (śifr) and Latin (zephirum) before becoming the English word we use today.
Brahmagupta didn’t just use zero as a placeholder — he gave it real mathematical rules, treating it as a number in its own right for the first time in history:
He even attempted rules for dividing by zero, though his answer (that x ÷ 0 = 0) turned out to be wrong — a problem so genuinely tricky that it took mathematicians another thousand years to fully understand why it has no answer at all (see the box below).
From India, the idea spread west. Around 825 CE, the Persian scholar Al-Khwarizmi — whose name gives us the word “algorithm” — described the Indian number system, including zero, in a book that was later translated into Latin. It reached Europe properly in 1202, when the Italian mathematician Fibonacci included it in his book Liber Abaci. Even then, many European merchants and even some governments distrusted the new symbol for over two centuries, and continued doing business in clumsy Roman numerals.
Without zero, there is no way to tell 305 from 35 or 3,050 — the position of each digit only means something because zero can hold an empty place. Try adding MCMXCVIII + VII (1998 + 7 in Roman numerals) in your head without converting it first — then try 1998 + 7. That difference is the entire reason zero changed the world.
Why can’t you divide by zero?
Division is really just the reverse of multiplication: saying a ÷ b = c means exactly the same thing as saying c × b = a.
Now try b = 0. If a is anything other than 0, you need a number c such that c × 0 = a. But c × 0 is always 0, no matter what c is — so no such c can exist. That’s why, for example, 5 ÷ 0 is undefined.
If a is also 0, the equation becomes c × 0 = 0 — and now every value of c works. Since there isn’t one single correct answer, mathematicians call 0 ÷ 0 indeterminate rather than undefined. Either way, division by zero breaks down — not because mathematicians decided to ban it, but because no consistent answer can exist.
Pi (π) Is Older Than You Think
The value of π (3.14159…) — the ratio of a circle’s circumference to its diameter — has fascinated mathematicians for over 4,000 years. The Babylonians approximated it as 3⅓ (3.125), while the Egyptian Rhind Papyrus (c. 1650 BCE) implies a value of about 3.16049. Both are surprisingly close for calculations done entirely by hand.
The first person to calculate π with real mathematical rigour was the Greek mathematician Archimedes of Syracuse, around 250 BCE. Rather than measuring circles physically (which is never very accurate), he trapped π between two numbers using pure geometry, proving that it must lie between 223/71 (≈ 3.1408) and 22/7 (≈ 3.1429) — a method described in the box below.
Centuries later, the Chinese mathematician Zu Chongzhi (429–500 CE) pushed this even further, calculating π as 355/113 — accurate to six decimal places. Astonishingly, no one beat this record for over 800 years.
Today, supercomputers have calculated π to more than 100 trillion digits, yet we already know they’ll never find a pattern: π is irrational (its digits never repeat) and even transcendental — a fact proven by Ferdinand von Lindemann in 1882, which also finally settled a 2,000-year-old open question by proving that it is mathematically impossible to “square the circle” using only a compass and straightedge.
The famous school shortcut 22/7 equals 3.142857… — only about 0.04% larger than the true value of π. For most everyday purposes it’s close enough, but NASA uses π to around 15 decimal places for interplanetary navigation, and even then only because more precision simply isn’t needed — not because more isn’t known.
How Archimedes trapped π using polygons
Archimedes’ idea was beautifully simple: draw a circle, then draw a regular polygon just inside it and another regular polygon just outside it. The circle’s circumference must always sit between the perimeters of the two polygons.
He started with hexagons (6 sides), where the maths is easy, and got a first rough bound. Then he doubled the number of sides — to 12, then 24, then 48, and finally 96-sided polygons — recalculating the perimeters each time using nothing but the Pythagorean theorem and some careful bookkeeping of square roots.
By the time he reached 96 sides, the inner and outer polygons were so close to the circle (and to each other) that he could prove, with certainty, 223/71 < π < 22/7. No measurement, no guessing — just geometry, repeated patiently by hand.
Fibonacci Sequence in Nature
The Fibonacci sequence (1, 1, 2, 3, 5, 8, 13, 21, 34…) is built from one of the simplest rules in mathematics: each number is the sum of the two before it. It’s named after the Italian mathematician Leonardo of Pisa, nicknamed “Fibonacci,” who introduced it to Europe in 1202 using a puzzle about how fast rabbits multiply. In fact, Indian scholars — including the poet-mathematician Pingala, writing around 200 BCE — had already discovered the same sequence centuries earlier, while studying the rhythms of Sanskrit poetry.
What makes the sequence genuinely famous, though, is how often it turns up in the natural world. Sunflower seed heads typically show 34 spirals curving one way and 55 the other — both Fibonacci numbers. Pinecones and pineapples show similar spiral counts, and many flowers have a Fibonacci number of petals: lilies have 3, buttercups have 5, and daisies often have 34, 55, or even 89.
As the sequence grows, the ratio between consecutive terms (like 34/21 or 55/34) settles closer and closer to a special number: φ (phi) ≈ 1.6180339887…, known as the golden ratio. This same ratio shows up in the proportions of nautilus shells, hurricane spirals, and even the spacing of leaves around a stem — an arrangement that happens to be a remarkably efficient way to catch sunlight.
3/2 = 1.5 → 5/3 = 1.667 → 8/5 = 1.6 → 13/8 = 1.625 → 21/13 = 1.615 → 34/21 = 1.619… Each ratio overshoots and undershoots φ ≈ 1.618034, homing in a little closer every step.
Binet’s formula: a whole number from irrational parts
It seems impossible that a formula built entirely from square roots could ever produce a clean whole number — yet that is exactly what Binet’s formula does for every single Fibonacci number:
where φ = (1+√5)/2 ≈ 1.618034 and ψ = (1−√5)/2 ≈ −0.618034.
Check it for n = 5: φ5 ≈ 11.0902 and ψ5 ≈ −0.0902. Subtracting gives 11.1803, and dividing by √5 ≈ 2.2361 gives exactly 5.000 — which is indeed the 5th Fibonacci number. Every irrational piece cancels out perfectly, every single time, no matter how large n gets.
Pythagoras and His Theorem
The famous Pythagorean Theorem — a² + b² = c² for any right-angled triangle — is credited to the Greek philosopher Pythagoras (c. 570–495 BCE), who founded a secretive brotherhood in the city of Croton that treated numbers as almost sacred. But the relationship itself was already known, and used in practice, over a thousand years earlier: the Babylonian clay tablet Plimpton 322 (c. 1800 BCE) lists Pythagorean triples, and Egyptian “rope stretchers” used loops of rope knotted into a 3-4-5 triangle to lay out perfect right angles when building the pyramids.
What Pythagoras and his followers are credited with is something more powerful than a formula — the first known general proof that the relationship holds for every right triangle, not just the ones people had happened to measure.
The theorem’s discovery also led to a genuine mathematical crisis. Using it on a right triangle with both shorter sides equal to 1 gives a hypotenuse of √2 — and one of Pythagoras’s own students, Hippasus, is said to have proven that √2 cannot be written as a fraction at all. This directly contradicted the school’s core belief that “all is number” (meaning whole numbers and simple ratios). Legend holds that the discovery was so unsettling that Hippasus was thrown overboard at sea for revealing it.
3² + 4² = 9 + 16 = 25 = 5². This is the simplest whole-number right triangle, and it’s exactly the one Egyptian builders used: knot a rope into 12 equal segments, pull it into a triangle with sides of 3, 4, and 5 segments, and the angle between the 3 and 4 sides is guaranteed to be a perfect right angle.
Geometric rearrangement proof
Left: a right triangle with a square built on each side. Middle: four copies of the triangle, packed into a square, leaving c² uncovered. Right: the same four triangles, slid into the corners of an identical square, now leaving a² + b² uncovered.
Consider four identical right-angled triangles with leg lengths a and b, and hypotenuse c — shown alone on the left below, with a square built on each of its three sides.
Step 1 — Form the first square. Arrange the four triangles inside a square frame with side length (a + b), as in the middle diagram. Outer square side: (a + b). Area of the four triangles: 4 × (½ab) = 2ab. The uncovered space in the centre is a tilted square with side c, so its area is c².
Step 2 — Rearrange the triangles. Without changing the outer (a + b) × (a + b) boundary at all, slide the same four triangles into two opposite corners, as in the right-hand diagram. The outer boundary is unchanged, and the four triangles still cover exactly 2ab — but now the uncovered space splits into two separate squares: one of side a (area a²) and one of side b (area b²).
Step 3 — Compare the leftover area. Both arrangements start from the exact same outer square and remove the exact same four triangles, so whatever area is left over must be equal in both cases: c² = a² + b².
Algebraic verification. The total area of the outer square can be written two ways. Directly: (a + b)² = a² + 2ab + b². Or as the four triangles plus the central square: 4(½ab) + c² = 2ab + c². Since both describe the same square, they’re equal: a² + 2ab + b² = 2ab + c². Subtracting 2ab from both sides leaves exactly a² + b² = c².
The Mystery of Prime Numbers
Prime numbers (2, 3, 5, 7, 11, 13…) are often called the “atoms” of mathematics, because of the Fundamental Theorem of Arithmetic: every whole number greater than 1 can be broken down into prime factors in exactly one way. For example, 60 = 2² × 3 × 5 — and no other combination of primes multiplies to 60.
Despite being so fundamental, primes remain full of open mysteries. The Twin Prime Conjecture guesses that there are infinitely many pairs of primes exactly 2 apart (like 11 & 13, or 17 & 19) — still unproven, though in 2013 mathematician Yitang Zhang made history by proving that infinitely many prime pairs exist within some bounded gap (originally 70 million, since narrowed down to 246 by other mathematicians).
The Goldbach Conjecture, proposed in 1742, claims every even number greater than 2 is the sum of two primes (8 = 3+5, 20 = 7+13). It has been checked by computer for every even number up to 4 quintillion — and not one exception has ever been found — yet nobody has ever proven it must be true for all even numbers. And looming over all of prime number theory is the Riemann Hypothesis, one of the most important unsolved problems in all of mathematics, with a $1 million prize attached for whoever proves it.
360 = 2² × 3² × 5 — and no matter how you break 360 down (2×180, 4×90, 8×45…), keep factoring and you always land on exactly the same set of prime building blocks.
Euclid’s proof: there is no biggest prime
Around 300 BCE, Euclid proved that the list of primes never ends — using one of the most elegant arguments in all of mathematics, by showing that assuming a largest prime leads straight to a contradiction.
Suppose there were only finitely many primes: p₁, p₂, …, pₙ. Multiply every one of them together and add 1: N = (p₁ × p₂ × … × pₙ) + 1.
Dividing N by any prime on our list always leaves a remainder of exactly 1 (since N is 1 more than a multiple of every one of them). So none of our “complete” list of primes divides N evenly.
But every whole number greater than 1 must have at least one prime factor. Since none of our listed primes works, N’s prime factor (or N itself, if N happens to be prime) must be a prime that was missing from our supposedly complete list — a contradiction. So no finite list of primes can ever be complete.
Try it with the first three primes: 2 × 3 × 5 + 1 = 31, which is itself a brand new prime, right on cue.
The Magic of 1089
Here’s a trick that feels like real magic the first time you see it:
No matter which starting number you pick — 852, 731, 940, anything — you will always land on exactly 1089. It isn’t magic, and it isn’t a coincidence: it’s guaranteed by algebra, and the full reason why is short enough to fit in the box below.
- Pick any 3-digit number where the first and last digits are different (e.g., 521).
- Reverse it (125).
- Subtract the smaller from the larger (521 − 125 = 396).
- Reverse that result (693).
- Add the two numbers together (396 + 693 = 1089).
852 → reverse: 258 → subtract: 852 − 258 = 594 → reverse: 495 → add: 594 + 495 = 1089. Same answer, every time.
The full algebraic proof
Let the three digits of the starting number be a, b, c (with a > c), so the number equals 100a + 10b + c. Its reverse is 100c + 10b + a.
Subtracting: (100a + 10b + c) − (100c + 10b + a) = 99a − 99c = 99(a − c). Let d = a − c (a whole number from 1 to 9). The subtraction step always produces exactly 99d.
Every multiple of 99 from 99 to 891 has a very specific digit pattern: the tens digit is always 9, the hundreds digit is (d−1), and the ones digit is (10−d). For example, d = 3 gives 99 × 3 = 297: hundreds = 2, tens = 9, ones = 7.
Reversing those digits (10−d, 9, d−1) gives the number 100(10−d) + 90 + (d−1) = 1000 − 100d + 90 + d − 1 = 1089 − 99d.
Add the subtraction result to its own reverse: 99d + (1089 − 99d) = 1089. The d cancels out completely — which is exactly why the starting number never mattered in the first place.
The Largest Known Prime Number
As of October 2024, the largest known prime number is 2136,279,841 − 1 — a staggering 41,024,320 digits long. Printed in a standard book, it would run to thousands of pages of digits and nothing else. It was discovered by Luke Durant, a former NVIDIA engineer, using thousands of cloud GPUs donated to the Great Internet Mersenne Prime Search (GIMPS), a volunteer computing project that has found every record-breaking prime since 1996.
Every single record-holder for decades has taken the form 2p − 1, called a Mersenne prime after the 17th-century French monk Marin Mersenne, who studied numbers of this exact shape. That’s not a coincidence: mathematicians have a remarkably fast way to test whether a Mersenne number is prime (described below), which makes numbers of this specific form the only realistic candidates for record-breaking searches — testing an arbitrary number this large for primality by ordinary methods would take longer than the age of the universe.
Such enormous primes aren’t just for bragging rights, either: prime numbers are the mathematical backbone of the encryption that keeps online banking, passwords, and private messages secure.
2²−1=3, 2³−1=7, 2⁵−1=31, 2⁷−1=127 are all prime. But not every Mersenne number is: 2⁴−1=15=3×5 is not prime, which is why p itself must also be prime before 2p−1 even stands a chance.
The Lucas–Lehmer test
To check whether 2p − 1 is prime, mathematicians use the Lucas–Lehmer test: build a sequence starting at s₀ = 4, where each next term is sk+1 = sk² − 2, and take the remainder after dividing by 2p−1 at every step. 2p−1 is prime exactly when the (p−2)th term of this sequence comes out to exactly 0.
Let’s check p = 5, so 2⁵−1 = 31: s₀=4. s₁ = 4²−2 = 14. s₂ = 14²−2 = 194, and 194 mod 31 = 8 (since 31×6=186). s₃ = 8²−2 = 62, and 62 mod 31 = 0.
That’s sp−2 = s₃ = 0 exactly — confirming that 31 is indeed prime, using only three quick steps instead of checking every possible divisor by hand.
Mathematicians and Cake
The Cake-Cutting Problem asks a question that sounds simple but hides real mathematics: how do you divide a cake among several people so that nobody feels short-changed — without a referee, and without anyone needing to trust anyone else?
For two people, the answer has been known for centuries: “I cut, you choose.” One person cuts the cake into two pieces, and the other picks whichever piece they want. The cutter, knowing this, is motivated to cut as evenly as possible — and whichever piece the chooser picks, they’re guaranteed to feel they got at least half.
For three or more people, it gets surprisingly hard. It took until the 1960s for mathematicians John Selfridge and John Conway to independently find a method (now called the Selfridge–Conway procedure) that guarantees an “envy-free” division for three people — meaning nobody would rather have someone else’s slice — though it can require cutting the cake into as many as five pieces along the way. For any number of people, a fully general envy-free method was only found in 2016, and while it’s mathematically guaranteed to work, the number of cuts it might need to make is so astronomically large it’s completely impractical — a reminder that “solved” in mathematics doesn’t always mean “practical.”
Suppose Alex cuts the cake unevenly, leaving one piece bigger. Jordan, who chooses second, will simply take the bigger piece — so Alex’s best strategy is always to cut as evenly as they possibly can. That single incentive is the entire proof.
Math and Ancient Egyptians
Ancient Egyptian mathematicians were remarkably advanced for their time, using a base-10 system and sophisticated fraction techniques to plan and build monuments like the Great Pyramid of Giza — a structure so precisely aligned that its base is level to within about 2 centimetres over 230 metres.
Their approach to fractions, however, was completely different from ours. The Egyptians only had a symbol for unit fractions — fractions with a numerator of 1, like 1/2, 1/3, or 1/4. Any other fraction had to be rewritten as a sum of different unit fractions. This method, preserved in the Rhind Mathematical Papyrus (c. 1650 BCE, itself a copy of an even older document), was used to solve very practical problems — like fairly dividing loaves of bread or jugs of beer among workers.
A special set of fractions, called the Eye of Horus fractions (1/2, 1/4, 1/8, 1/16, 1/32, 1/64), were used for measuring grain volumes and were linked to an Egyptian myth about the god Horus. Curiously, added together they total 63/64 — not quite a whole — which ancient scribes explained mythologically rather than as a rounding error.
2/7 = 1/4 + 1/28. Check it: 1/4 = 7/28, and 7/28 + 1/28 = 8/28 = 2/7 exactly. Egyptian scribes had systematic methods (and even reference tables) for finding decompositions like this for any fraction they needed.
Numbers with Names
Some numbers are so unusual — or so enormous — that mathematicians have given them their own names.
1 followed by 100 zeros (10100). It was named in 1920 by 9-year-old Milton Sirotta, nephew of mathematician Edward Kasner — and it later inspired the name of a certain search engine, spelled slightly differently: Google.
10 raised to the power of a googol — that’s a 1 followed by a googol worth of zeros. It’s so large that even writing out all its digits, one per particle, would require more particles than exist in the entire observable universe.
First used as a symbol by English mathematician John Wallis in 1655. It doesn’t represent a specific number at all, but the idea of something without any end — and, remarkably, mathematicians have proven that some infinities are actually bigger than others (see the box below).
A number so large it once held the Guinness World Record for “largest number ever used in a serious mathematical proof.” It’s so vast that ordinary exponents can’t even describe it — mathematicians need a special layered notation just to write it down.
Cantor’s proof: some infinities are bigger than others
It feels like “infinity” should just mean one single, biggest idea — but in 1891, Georg Cantor proved something genuinely shocking: there are more real numbers between 0 and 1 than there are whole numbers in total, even though both lists go on forever.
Suppose you claimed to have a complete list of every real number between 0 and 1, numbered 1st, 2nd, 3rd, and so on forever. Cantor showed you can always build a brand new number that isn’t on your list: take the 1st digit of the 1st number and change it to something else, take the 2nd digit of the 2nd number and change it, the 3rd digit of the 3rd number, and so on.
This new number differs from every single number on your list in at least one digit — so it can’t be anywhere on the list, no matter how the list was built. That means no such “complete” list can ever exist: there are strictly more real numbers than whole numbers, even though both sets are infinite. This is known as Cantor’s diagonal argument, and it launched an entirely new branch of mathematics devoted to comparing different sizes of infinity.
The Curious Case of 1
Is 1 a prime number? It has exactly one divisor, it can’t be split into smaller factors, and for much of the 19th century, many respected mathematics textbooks confidently listed it as prime. Today, every mathematician agrees it is not — and the reason isn’t just a matter of definition-tweaking, but something that would genuinely break mathematics if it were ignored.
The modern definition requires a prime number to have exactly two distinct divisors: 1 and itself. The number 1 only has one divisor (itself), so it fails the definition immediately. Mathematicians instead put 1 into its own special category, called a unit.
Every counting number greater than 1 is supposed to have exactly one way to be broken into prime factors. But 12 = 2²×3 = 2²×3×1 = 2²×3×1×1 = … and so on forever, if 1 were allowed as a prime. Suddenly every number would have infinitely many “different” factorisations, and a cornerstone of number theory would collapse.
The Fundamental Theorem of Arithmetic
This theorem states that every whole number greater than 1 can be written as a product of primes in exactly one way (ignoring the order you write them in). It is one of the load-bearing walls of number theory — used, directly or indirectly, in almost every proof involving whole numbers.
Excluding 1 from the primes isn’t an arbitrary rule invented to make the theorem true — it’s the only sensible choice that keeps “exactly one way” meaningful at all. That is the real reason 1 is not, and cannot be, a prime number.
Pascal’s Triangle
Pascal’s Triangle is a triangular grid of numbers where every entry is the sum of the two numbers directly above it. It’s named after the French mathematician Blaise Pascal, who wrote a systematic treatise on it in 1654 — but, much like the Fibonacci sequence, it was discovered independently and far earlier in other cultures: by Indian scholar Pingala around 200 BCE, by Persian mathematicians Al-Karaji and Omar Khayyam around 1000 CE (where it’s still called “Khayyam’s Triangle” in Iran), and by Chinese mathematician Yang Hui in 1261 (where it’s known as “Yang Hui’s Triangle” to this day).
The triangle is bursting with hidden patterns. Each row sums to a power of 2 (row n adds up to 2n). One diagonal contains the ordinary counting numbers; the next contains the triangular numbers (1, 3, 6, 10…); and if you add up numbers along certain shallow diagonals, the Fibonacci sequence from Fact 3 appears again, hiding in plain sight.
Pascal’s own major breakthrough was using the triangle to help found modern probability theory, in a famous exchange of letters with fellow mathematician Pierre de Fermat about how to fairly split the stakes in an interrupted gambling game.
Row 0: 1 Row 1: 1, 1 Row 2: 1, 2, 1 Row 3: 1, 3, 3, 1 Row 4: 1, 4, 6, 4, 1 Row 5: 1, 5, 10, 10, 5, 1. Notice each row sums to a power of 2: 1, 2, 4, 8, 16, 32.
Why each entry is a binomial coefficient
Every entry in Pascal’s Triangle is a binomial coefficient: the entry in row n, position k equals C(n,k) = n! / (k!(n−k)!) — the number of ways to choose k items from a group of n, where order doesn’t matter.
This directly proves why each number is the sum of the two above it (a rule called Pascal’s Rule): imagine choosing k items out of n, where one particular item is a fixed “special” one. Either you include that special item — leaving C(n−1, k−1) ways to choose the rest — or you exclude it entirely — leaving C(n−1, k) ways to choose all k from what remains. Every valid choice falls into exactly one of those two cases, so C(n,k) = C(n−1,k−1) + C(n−1,k) — which is exactly the “add the two numbers above” rule the triangle is built from.