Question 13 Marks
Use Euclid’s division algorithm to find the HCF of 441, 567, 693.
Answer
View full question & answer→Let a = 693, b = 567 and c = 441 By Euclid's division algorithmes,
By Euclid's division algorithms,
a = bq + r .....(i)
[$\because$ dividend = divisor × quotient + remainder]
First we take, a = 693 and b = 567 and find their HCF.
693 = 567 × 1 + 126
567 = 126 × 4 + 63
126 = 63 × 2 + 0
$\therefore$ HCF (693, 567) = 63
Now, we take c = 441 and say d = 63, then find their HCF.
Again, using Euclid's division algorithm,
c = dq + r
⇒ 441 + 63 × 7 + 0
$\therefore$ HCF (693, 567, 441) = 63
By Euclid's division algorithms,
a = bq + r .....(i)
[$\because$ dividend = divisor × quotient + remainder]
First we take, a = 693 and b = 567 and find their HCF.
693 = 567 × 1 + 126
567 = 126 × 4 + 63
126 = 63 × 2 + 0
$\therefore$ HCF (693, 567) = 63
Now, we take c = 441 and say d = 63, then find their HCF.
Again, using Euclid's division algorithm,
c = dq + r
⇒ 441 + 63 × 7 + 0
$\therefore$ HCF (693, 567, 441) = 63