Advertisements
Advertisements
प्रश्न
Use Euclid’s division algorithm to find the HCF of 441, 567, 693.
उत्तर
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
संबंधित प्रश्न
Prove that the product of three consecutive positive integer is divisible by 6.
Define HOE of two positive integers and find the HCF of the following pair of numbers:
18 and 24
The length, breadth and height of a room are 8 m 25 cm, 6 m 75 cm and 4 m 50 cm, respectively. Determine the longest rod which can measure the three dimensions of the room exactly.
Two brands of chocolates are available in packs of 24 and 15 respectively. If I need to buy an equal number of chocolates of both kinds, what is the least number of boxes of each kind I would need to buy?
Using prime factorization, find the HCF and LCM of 36, 84 In case verify that HCF × LCM = product of given numbers.
Three measuring rods are 64 cm, 80 cm and 96 cm in length. Find the least length of cloth that can be measured an exact number of times, using any of the rods.
Six bells commence tolling together and toll at intervals of 2, 4, 6, 8, 10, 12 minutes respectively. In 30 hours, how many times do they toll together?
What do you mean by Euclid’s division algorithm.
If the LCM of a and 18 is 36 and the HCF of a and 18 is 2, then a =
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
