Euclid’s division lemma

Euclid’s division algorithm

Fundamental Theorem of Arithmetic

√3

√9

0 ≤ r < b

he HCF of any two positive integers a and b, with a > b

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.

irrational

rational