Advertisements
Advertisements
Question
Use Euclid’s division algorithm to find the HCF of 441, 567, 693.
Solution
Let a = 693, b = 567 and c = 441
By Euclid’s division algorithm,
a = bq + r ......(i) [∵ 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
∴ 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
`\implies` 441 = 63 × 7 + 0
∴ HCF(693, 567, 441) = 63
APPEARS IN
RELATED QUESTIONS
Use Euclid's Division Algorithm to show that the cube of any positive integer is either of the 9m, 9m + 1 or 9m + 8 for some integer m
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `23/(2^3 × 5^2)`
Express 360 as product of its prime factors
Prove that \[2 - 3\sqrt{5}\] is an irrational number.
The LCM of two numbers is 1200. Which of the following cannot be their HCF?
If n is a natural number, then 92n − 42n is always divisible by ______.
Show that every positive odd integer is of the form (4q + 1) or (4q + 3), where q is some integer.
Euclid’s division lemma states that for positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy
Show that 107 is of the form 4q +3 for any integer q
Prove that if x and y are both odd positive integers, then x2 + y2 is even but not divisible by 4.
