H. C. F. & L. C. M. OF NUMBERS
(21) Find the lowest number which when subtracted from 10000, is exactly divisible by 15, 27 and 24.
Soln. L.C.M. of 15, 27 and 24 = 1080.
If we divide 10000 by 1080, we get the remainder = 280
i.e. If 280 i…
(11) Greatest number which can divide 327, 352, 200 leaving respectively 12, 7, 5 as remainders, is :
Soln. Required number = H.C.F. of ( 327 – 12 ), ( 352 – 7 ), ( 200 – 5 )
= H.C.F. of 315, 345, 195
…
☼ Comparison of Fractions : Find the L.C.M. of the denominators of the given fractions. Convert each of the fractions into an equivalent fraction with L.C.M. as the denominator, by multiplying both the numerator and denominator by…
☼ H.C.F. and L.C.M. of Decimal Fractions : In given numbers, make the same number of decimal places by annexing zeros in some numbers, of necessary. Considering these numbers without decimal point, find H.C.F. or L.C.M. of as the…
☼ Euclidean Algorithm : Of ‘d’ is the H.C.F. of two positive integers ‘a’ and ‘b’, then there exists unique integers ‘m’ and ‘n’ such that d = am + bn.
e.g. (15, 21) = 3 <...
☼ To find L. C. M. of Given Numbers :
■ L. C. M. by Definition : Write all the multiples of each number and take common multiples of all multiples and then select the least …