Advertisements
Advertisements
Question
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 867 and 255
Advertisements
Solution
To find the H.C.F. of 867 and 255, Using Euclid’s division algorithm.
867 = 255 × 3 + 102
The remainder 102 ≠ 0.
Again using Euclid’s division algorithm
255 = 102 × 2 + 51
The remainder 51 ≠ 0.
Again using Euclid’s division algorithm
102 = 51 × 2 + 0
The remainder is zero.
Therefore = 51
Therefore the H.C.F. of 867 and 255 is 51.
APPEARS IN
RELATED QUESTIONS
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
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 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?
