Introduction — Euclid's Division Lemma

What Are Real Numbers?

Every number you encounter in mathematics — whether it is a simple counting number, a fraction, a negative integer, or a non-terminating decimal like π — belongs to a broader family called Real Numbers. In Class 10 Mathematics (CBSE, Telangana, and Andhra Pradesh syllabus), Chapter 1 builds on everything you studied about numbers in earlier classes and gives these ideas a rigorous foundation.

The real number system is organised as a hierarchy of nested sets. Understanding where each type of number fits helps you classify any number instantly — a skill directly tested in board exams.

The Number System Hierarchy

• Natural Numbers (N) — The counting numbers: 1, 2, 3, 4, … They are the innermost set.
• Whole Numbers (W) — Natural numbers plus zero: 0, 1, 2, 3, …
• Integers (Z) — All whole numbers together with their negatives: … −3, −2, −1, 0, 1, 2, 3, …
• Rational Numbers (Q) — Any number that can be written as p/q where p and q are integers and q ≠ 0. Examples include 3/2, 0.59, −35, and 2.34. This set contains all the integers as a subset.
• Irrational Numbers (Q′) — Numbers that cannot be expressed in p/q form. Their decimal expansions are non-terminating and non-repeating. Examples: √3, ∛5, π, and 2.31904798…
• Real Numbers (R) — The complete set formed by combining all rational and irrational numbers. Every point on the number line corresponds to exactly one real number.

Euclid's Division Lemma — The Core Theorem

One of the most important results in this chapter comes from Euclid, an ancient Greek mathematician best known for his 13-book work Euclid's Elements. The Division Lemma appears in Book VII and forms the foundation of what is called the Fundamentals of Number Theory.

The lemma states: given any two positive integers a and b, there exists a unique pair of integers q (quotient) and r (remainder) such that:

In plain terms, when you divide any integer a by a positive integer b, the remainder r is always less than the divisor b and is never negative. For example, dividing 13 by 3 gives 13 = 3 × 4 + 1, and dividing 34 by 9 gives 34 = 9 × 3 + 7. This is exactly the long division you already know — the lemma simply proves it works for every pair of integers, without exception.

Euclid's Division Algorithm — Finding the HCF

The lemma becomes a powerful tool when applied repeatedly to find the Highest Common Factor (HCF) of two numbers. The HCF is the largest positive integer that divides both numbers exactly. The step-by-step procedure of applying the division lemma repeatedly until the remainder becomes zero is called Euclid's Division Algorithm.

Here is how it works for finding the HCF of 100 and 60:

• Step 1: Divide the larger by the smaller — 100 = 60 × 1 + 40
• Step 2: Now divide 60 by the remainder 40 — 60 = 40 × 1 + 20
• Step 3: Divide 40 by 20 — 40 = 20 × 2 + 0
• When the remainder becomes 0, the last divisor is the HCF. Here, HCF(100, 60) = 20.

Another quick example: to find HCF of 96 and 72, apply 96 = 72 × 1 + 24, then 72 = 24 × 3 + 0. The remainder is 0, so HCF(96, 72) = 24. Notice how the algorithm always terminates because the remainders keep decreasing.

Common Mistakes to Avoid

• Always apply the lemma with the larger number as the dividend in the first step — swapping them gives the wrong starting equation.
• The condition is 0 ≤ r < b, so the remainder must be strictly less than the divisor, never equal to it.
• Do not stop at the step before the remainder reaches zero — the HCF is the divisor in the step where the remainder first becomes 0, not the step before.
• Remember that irrational numbers like √4 = 2 are actually rational (and even integers). Always simplify before classifying.

What This Lesson Prepares You For

Mastering the introduction to Real Numbers and Euclid's Division Lemma sets you up for the rest of Chapter 1, where you will use the algorithm to prove the irrationality of numbers like √2 and √3, and study the decimal expansions of rational numbers. These topics are high-weightage areas in both Telangana and Andhra Pradesh board exams as well as CBSE board exams. You can continue your preparation with the Euclid's Division Algorithm exercises, explore how these ideas connect to the Fundamental Theorem of Arithmetic, or revisit the groundwork laid in Class 9 Real Numbers.