Advertisements
Advertisements
Question
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 10224 and 9648
Solution
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
RELATED QUESTIONS
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 867 and 255
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 84, 90 and 120
If the H.C.F of 65 and 117 is expressible in the form of 65m – 117, then the value of m is
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 :
Number of cans of cow’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.
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?
