Advertisements
Advertisements
Question
Find the largest number which divides 1230 and 1926 leaving remainder 12 in each case
Solution
The required number is the H.C.F. of the number.
1230 – 12 = 1218,
1926 – 12 = 1914
First we find the H.C.F. of 1218 & 1914 by Euclid’s division algorithm.
1914 = 1218 × 1 + 696
The remainder 696 ≠ 0.
Again using Euclid’s algorithm
1218 = 696 × 1 + 522
The remainder 522 ≠ 0.
Again using Euclid’s algorithm.
696 = 522 × 1 + 174
The remainder 174 ≠ 0.
Again by Euclid’s algorithm
522 = 174 × 3 + 0
The remainder is zero.
∴ The H.C.F. of 1218 and 1914 is 174.
∴ The required number is 174.
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 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.
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?
