Euclid's division lemma states that for any two positive integers a and b, there exist unique integers q and r such that a = bq + r, where 0 ≤ r < b. This provides an algorithm, known as the Euclidean algorithm, to find the highest common factor (HCF) of two integers by repeatedly dividing the larger number by the smaller number. The fundamental theorem of arithmetic states that every composite number can be uniquely expressed as a product of prime numbers, apart from the order of factors. Some key results discussed are: every positive odd integer is of the form 6q + 1, 6q + 3, or 6q + 5; the square of any positive integer is of the form 3m