REAL NUMBERS TOPICS 1. EUCLID'S DIVISION LEMMA 2. EUCLID'S DIVISION ALGORITHM 3. FUNDAMENTAL THEOREM OF ARITHMETIC 4. DECIMAL REPRESENTATION OF RATIONAL NUMBERS 5.UNIT DIGIT OF ANY POWER EUCLID'S DIVISION LEMMA Given two positive integers a and b, there exist unique integers q and r satisfying a= bq + r where 0 ≤ r < b For eg, 11 = 2 × 5 + 1 Here, a = 11 , b = 2 , q = 5 , r = 1 Here, 'a' is the dividend, 'q' is the quotient, 'b' is the divisor and 'r' is the remainder.Here 'q' and 'r' can be zero. For eg , 15 = 17 × 0 + 15 (here q is zero) 10 = 2 × 5 + 0 (here r is zero) EUCLID'S DIVISION ALGORITHM Euclid's division algorithm is a technique to find HCF (highest common factor) of 2 positive integers. Euclid's division algorithm can be stated as follows : HCF of 2 p...