Facts that Matter
Note:
I. We state Euclid’s Divison Algorithm for positive integers only but it can be extended for all integers except zero i.e., b ≠0.
II. When ‘a’ and ‘b’ are two positive integers such that a = bq + r, 0 ≤ r < b then HCF (a, b) = HCF (b, r).
Fundamental Theorem of Arithmetic
Every composite number can be expressed as a product of primes, and this factorisation is unique, apart from the order in which the prime factors occur.