## Revision Notes ofÂ Ch 1 Real Numbers Class 10th Math

**Topics in the Chapter**

- Euclidâ€™s Division Lemma
- Euclidâ€™s Division Algorithm
- The Fundamental Theorem of Arithmetic
- Revisiting Irrational Numbers
- Revisiting Rational Numbers and Their Decimal Expansions

**Euclidâ€™s Division Lemma**

â†’ For any two positive integers a and b, there exist unique integers q and r such that

Â Â Â

*a = bq + r, 0Â â‰¤ r < b*
Here,Â a, b, q and r are called dividend, divisor, quotient and remainder respectively.

â†’ Example: Dividing 34 by 6, we get quotient as 6 and remainder as 4.

So we can write it as, 34 = 6Ã—5 + 4

Here, a = 34, b = 6, q = 5 and r = 4

âˆ´ *a = bq + r, 0Â â‰¤ r < b*

**Euclidâ€™s Division AlgorithmÂ**

â†’ Euclidâ€™s Division Algorithm is application of Euclidâ€™s Division Lemma means it is technique to compute HCF of two natural numbers.

â†’ To obtain the HCF of two positive integers, say c and d, with c > d, we follow these steps:

Step 1: Apply Euclidâ€™s division lemma to c and d to obtain two whole numbers q and r.

*Â Â Â Â Â Â Â Â Â Â*Thus,

*c = dq + r, 0Â â‰¤ r < d*

Step 2 : If r = 0, d is the HCF of c and d. If r â‰ 0, again apply the division lemma to d and r.

Step 3 : Continue the process till the remainder is zero. The last divisor when remainder becomes zero is the HCF of c and d

â†’ Example: Use Euclidâ€™s division algorithm to find the HCF of 420 and 130.

Here, 420 > 130 so we can write,

Step 1: 420 = 130 Ã— 3 + 30 (remainder is 30 so we will apply division lemma again on 130 and 30)

Step 2: 130 = 30 Ã— 4 + 10 (remainder is 10 so we will apply division lemma again on 30 and 10)

Step 3: 30 = 10 Ã— 3 + 0

Now, the remainder is 0 and the last divisor is 10. So, 10 is the HCF of 420 and 130.

**The Fundamental Theorem of Arithmetic**

â†’

**Every composite number can be expressed (factorised) as a product of primes, and this factorisation is unique, apart from the order in which the prime factors occur.**

â†’ Let x be composite number which can be factorised as,

x =Â p

_{1}p

_{2}..... p

_{n}, whereÂ p

_{1}p

_{2}..... p

_{n}are primes and written in ascending order, i.e., p

_{1}â‰¤ p

_{2}â‰¤ ..... â‰¤ p

_{n}. If we combine the same primes, we will get powers of primes. This is called prime factorization.

For example: 32760 = 2 Ã— 2 Ã— 2 Ã— 3 Ã— 3 Ã— 5 Ã— 7 Ã— 13 = 2

^{3}Ã— 3

^{2}Ã— 5 Ã— 7 Ã— 13

By expressing any two numbers as their prime factors, their highest common factor (HCF) and lowest common multiple (LCM) can be calculated.