All questions
6
Q1
State Euclid's division lemma and explain how it is used to find the HCF of two positive integers.
Euclid's division lemma says that for positive integers and , there exist unique integers and such that , where . Repeated use of this relation gives Euclid's division algorithm for finding HCF.
Q2
Find the HCF of and using Euclid's division algorithm.
Using Euclid's algorithm: , , . Therefore, HCF .
Q3
State the Fundamental Theorem of Arithmetic. How does it help in finding HCF and LCM?
The Fundamental Theorem of Arithmetic states that every composite number can be expressed as a product of primes, and this factorisation is unique apart from the order of the prime factors. HCF uses the lowest powers of common primes; LCM uses the highest powers of all primes.
Q4
Use the Fundamental Theorem of Arithmetic to prove that is irrational.
Assume in lowest terms. Then , so is even and hence is even. Let . Then , so , making even. This contradicts that and are coprime. Hence is irrational.
Q5
When does the rational number have a terminating decimal expansion?
If and are coprime and the prime factorisation of is of the form , then has a terminating decimal expansion. Otherwise it has a non-terminating recurring decimal expansion.
Q6
Decide whether and have terminating decimal expansions.
For , , so it terminates. For , contains prime factor , so it is non-terminating recurring.