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
संबंधित प्रश्न
For any positive integer n , prove that n3 − n divisible by 6.
Find the HCF of the following pairs of integers and express it as a linear combination of 963 and 657.
If the HCF of 657 and 963 is expressible in the form 657x + 963y − 15, find x.
Using prime factorization, find the HCF and LCM of 12,15, 21 .
Using prime factorization, find the HCF and LCM of 21, 28, 36, 45 .
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.
Prove that for any prime positive integer p, \[\sqrt{p}\]
is an irrational number.
Use Euclid's division algorithm to find the HCF of 255 and 867.
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
There are 312, 260 and 156 students in class X, XI and XII respectively. Buses are to be hired to take these students to a picnic. Find the maximum number of students who can sit in a bus if each bus takes equal number of students ______.
