Q1: Find using the Euclidean algorithm.
SOLUTION
UNDERSTAND THE QUESTION
- We need to find the Greatest Common Divisor () of two positive integers, and , using the Euclidean algorithm.
- Although the Euclidean algorithm is traditionally emphasized more in higher classes or specific number theory modules, the concept of repeated division to find the Highest Common Factor (HCF) is directly aligned with the NCERT curriculum's approach to finding the HCF of numbers.
Step 1 — APPLY DIVISION LEMMA ON THE LARGER NUMBER
Compare the two numbers, and . Since , apply the Division Lemma to and to find whole numbers and such that , where .
Here, the remainder is . Since the remainder is not zero, we proceed to the next step.
Step 2 — APPLY DIVISION LEMMA ON THE DIVISOR AND REMAINDER
Now, take the divisor and the remainder . Apply the Division Lemma to and :
Here, , and . Thus, the remainder is . We continue the process.
Step 3 — CONTINUE THE PROCESS UNTIL THE REMAINDER IS ZERO
Next, take the new divisor and the new remainder . Apply the Division Lemma:
Here, the remainder has now become ().
The divisor at this stage, when the remainder is zero, is . Therefore, the of and is .
ANSWER
COMMON MISTAKES
- Stopping Prematurely: Stopping the division process before the remainder reaches .
- Arithmetic Errors: Incorrectly calculating the quotient or remainder during the division steps (e.g., miscalculating ).