Advertisements
Advertisements
प्रश्न
Using Euclid’s algorithm, find the HCF of 405 and 2520 .
उत्तर
On applying Euclid’s algorithm, i.e. dividing 2520 by 405, we get:
Quotient = 6, Remainder = 90
∴ 2520 = 405 × 6 + 90
Again on applying Euclid’s algorithm, i.e. dividing 405 by 90, we get:
Quotient = 4, Remainder = 45
∴ 405 = 90 × 4 + 45
Again on applying Euclid’s algorithm, i.e. dividing 90 by 45, we get:
∴ 90 = 45 × 2 + 0
Hence, the HCF of 2520 and 405 is 45.
APPEARS IN
संबंधित प्रश्न
Find the greatest number that will divide 445, 572 and 699 leaving remainders 4, 5 and 6 respectively.
During a sale, colour pencils were being sold in packs of 24 each and crayons in packs of 32 each. If you want full packs of both and the same number of pencils and crayons, how many of each would you need to buy?
Using prime factorization, find the HCF and LCM of 17,23,29 .
The HCF of two numbers is 145 and their LCM is 2175. If one of the numbers is 725, find
the other.
Find the simplest form of `69 /92` .
Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.
(i) `171/800`
Find the smallest number which when increased by 17 is exactly divisible by both 520 and 468.
The smallest number by which \[\sqrt{27}\] should be multiplied so as to get a rational number is
Use Euclid's division algorithm to find the HCF of 255 and 867.
When the positive integers a, b and c are divided by 13 the respective remainders is 9, 7 and 10. Find the remainder when a b + + 2 3c is divided by 13
