Cracking the Code of
Real Numbers
Prime factors, irrational numbers, HCF, LCM — all explained in plain English with zero panic.
Welcome back, math explorer! 👋 In Class IX you dipped your toes into the world of real numbers and bumped into those mysterious irrational numbers. Now it's time to go deeper — into the hidden rules that govern how every positive integer is built.
Don't be scared by terms like Euclid's Division Algorithm or Fundamental Theorem of Arithmetic. By the end of this post, they'll feel like old friends.
Euclid's Division Algorithm — A Flowchart
Design brief for a designer: A bright golden-yellow flowchart on a warm cream background. The flowchart starts with a top diamond shape labelled "Divide a by b → get quotient q and remainder r". An arrow labelled "Is r = 0?" branches right (YES) to a green circle marked "HCF = b ✅" and left (NO) to a blue rectangle labelled "Replace a → b, b → r" with a loop arrow curving back to the top. Key formula a = bq + r, 0 ≤ r < b is shown in a bold serif font inside an amber badge at the top. Friendly stick figures sit beside each decision box celebrating with thumbs-up icons.
⚙️ 1. The "Long Division" Secret: Euclid's Algorithm
You've been doing division for years. Euclid's Division Algorithm is simply that familiar long-division process written down as a formal rule.
🧬 2. The DNA of Numbers: The Fundamental Theorem of Arithmetic
If numbers were living organisms, the Fundamental Theorem of Arithmetic (FTA) would be their DNA.
// No other combination of primes gives exactly 32,760
Meet the "Prince of Mathematicians": Carl Friedrich Gauss (1777–1855)
While the FTA was hinted at in Euclid's ancient work, it was Gauss who provided the first correct formal proof in his landmark publication Disquisitiones Arithmeticae. Considered one of the three greatest mathematicians of all time (alongside Archimedes and Newton), Gauss made contributions to both mathematics and science that still shape the modern world.
HCF vs LCM — Side-by-Side Visual
Design brief for a designer: A bright mint-green side-by-side comparison card on a light teal background. Left panel (purple accent): labelled "HCF" with a Venn diagram of two overlapping circles for the numbers 6 and 20 — the overlapping region is highlighted in deep purple and shows the shared prime factor (2¹). Right panel (orange accent): labelled "LCM" showing both circles fully highlighted in orange, with the formula "2² × 3 × 5 = 60" beneath. An equals/not-equals sign between panels with a star badge shows "HCF × LCM = Product of the two numbers". Icons of calculator and stars add a playful touch.
🔢 3. HCF, LCM & The Magic Formula
Using the prime factorisation method — the practical superpower of the FTA — we can find HCF and LCM of numbers by studying their prime "power-ups."
| Method | What to do | Example: 6 & 20 |
|---|---|---|
| HCF | Take the smallest power of each common prime factor | 6 = 2¹ × 3¹ and 20 = 2² × 5¹. Common factor is 2. Smallest power = 2¹. HCF = 2 |
| LCM | Take the greatest power of every prime factor involved | Primes involved: 2, 3, 5. Greatest powers: 2², 3¹, 5¹. 4×3×5 = LCM = 60 |
HCF(a, b) × LCM(a, b) = a × b
Step 2: HCF = 2² = 4 (smallest power of common factor 2).
Step 3: LCM = (96 × 404) ÷ 4 = 9696.
🔍 4. Solving the Mystery: Can 4ⁿ Ever End in Zero?
Let's use prime factorisation to crack a puzzle: could 4ⁿ (where n is any natural number) ever end with the digit 0?
∞ 5. Proving the "Impossible": Why √2 is Irrational
In Class IX you were told that √2 is irrational. Now we can prove it — using a clever technique called Proof by Contradiction.
The 6-Step Proof that √2 is Irrational
- The Assumption: Suppose √2 is rational. Then √2 = a/b, where a and b are coprime integers (no common factors).
- The Squaring: Square both sides: 2 = a²/b², so 2b² = a².
- The Core Logic: This means 2 divides a². By Theorem 1.2 (if a prime p divides a², then p divides a), 2 must divide a.
- The Substitution: Write a = 2c. Plug back in: 2b² = (2c)² = 4c², so b² = 2c².
- The Dead End: Now 2 divides b² — so 2 must divide b as well. Both a and b are divisible by 2!
- The Contradiction: But a and b were supposed to be coprime. Having 2 as a common factor contradicts that. 💥 Our assumption was wrong. Therefore √2 is irrational!
💡 6. Bonus: When Does a Fraction Terminate?
Here's a bonus concept that ties everything together. For a rational number p/q (in lowest terms), the prime factorisation of the denominator q reveals the future of its decimal expansion:
- If the only prime factors of q are 2s and 5s (or both), the decimal terminates (stops). Example: 3/8 = 0.375
- If q has any prime factor other than 2 or 5, the decimal is non-terminating and repeating. Example: 1/3 = 0.333…
Will 5/12 terminate? 12 = 2² × 3. There's a 3! ❌ No — it's 0.41666… (repeating).
⚡ Quick Takeaways: Your Cheat Sheet
- Euclid's Division Algorithm: For any two positive integers a and b, we can write a = bq + r where 0 ≤ r < b. This is the backbone of computing HCF.
- Fundamental Theorem of Arithmetic (FTA): Every composite number has a unique prime factorisation — its one-of-a-kind "ingredient recipe."
- HCF Rule: Take the smallest power of every common prime factor from the numbers.
- LCM Rule: Take the greatest power of every prime factor across all the numbers.
- The Magic Formula (for 2 numbers only): HCF(a, b) × LCM(a, b) = a × b.
- Prime Factor Key Rule (Theorem 1.2): If a prime p divides a², then p also divides a. This is the secret weapon inside every irrationality proof.
- Irrational Proofs use "Proof by Contradiction": Assume it's rational → derive a logical impossibility → conclude it must be irrational.
- Numbers like √2, √3, √5 are irrational — and so are combinations like 5 − √3 or 3√2.
- Decimal Expansion Shortcut: A fraction terminates if and only if its denominator's prime factors are only 2s and/or 5s.
