Advertisements
Advertisements
प्रश्न
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 10224 and 9648
उत्तर
To find H.C.F. 10224 and 9648, Using Euclid’s division algorithm.
We get
10224 = 9648 × 1 + 576
The remainder 576 ≠ 0.
Again using Euclid’s division algorithm
9648 = 576 × 16 + 432
Remainder 432 ≠ 0.
Again applying Euclid’s division algorithm
576 = 432 × 1 + 144
Remainder 144 ≠ 0.
Again using Euclid’s division algorithm
432 = 144 × 3 + 0
The remainder is zero.
∴ HCF = 144
The H.C.F. of 10224 and 9648 is 144.
APPEARS IN
संबंधित प्रश्न
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 867 and 255
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 84, 90 and 120
Find the largest number which divides 1230 and 1926 leaving remainder 12 in each case
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 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
Consider the Postal Index Number (PIN) written on the letters as follows:
604506; 604516; 604560; 604506; 604516; 604516; 604560; 604516; 604505; 604470; 604515; 604520; 604303; 604509; 604470.
How the letters can be sorted as per Postal Index Numbers?
