Advertisements
Advertisements
प्रश्न
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 84, 90 and 120
उत्तर
To find H.C.F. of 84, 90 and 120.
Using Euclid’s division algorithm
90 = 84 × 1 + 6
The remainder 6 ≠ 0.
Again using Euclid’s division algorithm
84 = 6 × 14 + 0
The remainder is zero.
∴ The H.C.F. of 84 and 90 is 6. To find the H.C.F. of 6 and 120 using Euclid’s division algorithm.
120 = 6 × 20 + 0
The remainder is zero.
Therefore H.C.F. of 120 and 6 is 6
∴ H.C.F. of 84, 90 and 120 is 6.
APPEARS IN
संबंधित प्रश्न
A man has 532 flower pots. He wants to arrange them in rows such that each row contains 21 flower pots. Find the number of completed rows and how many flower pots are left over
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 340 and 412
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 10224 and 9648
The least number that is divisible by all the numbers from 1 to 10 (both inclusive) is
A milk man has 175 litres of cow’s milk and 105 litres of buffalow’s milk. He wishes to sell the milk by filling the two types of milk in cans of equal capacity. Calculate the following :
Capacity of a can
A milk man has 175 litres of cow’s milk and 105 litres of buffalow’s milk. He wishes to sell the milk by filling the two types of milk in cans of equal capacity. Calculate the following :
Number of cans of cow’s milk
A milk man has 175 litres of cow’s milk and 105 litres of buffalow’s milk. He wishes to sell the milk by filling the two types of milk in cans of equal capacity. Calculate the following :
Number of cans of buffalow’s milk
Write the numbers from 1 to 50. From that find the following.
The numbers which are neither divisible by 2 nor 7
Write the numbers from 1 to 50. From that find the following.
The prime numbers between 25 and 40
Write the numbers from 1 to 50. From that find the following.
All square numbers upto 50
