Learning Objectives
- Understand and apply Euclid's Division Algorithm to find the highest common factor (HCF) of two integers by expressing one number as a multiple of another plus a remainder.
- Utilize the Fundamental Theorem of Arithmetic to express every composite number uniquely as a product of prime numbers, apart from the order of the factors.
- Calculate the HCF and least common multiple (LCM) of integers using the Prime Factorization Method, leveraging their prime factorization.
- Prove the irrationality of numbers such as and using the Fundamental Theorem of Arithmetic and the method of contradiction.
- Explore the Properties of Rational and Irrational Numbers, particularly how the sum, difference, product, and quotient of these numbers behave.