sutra
☼ 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 …
☼ To find H.C.F. of Given Numbers :
■ H. C. F. by Definition : Write all the factors (divisors) of each number and take common factors (divisors) of all factors (divisors) and then sele…
☼ Factors & Multiples : If ‘a’ divides ‘b’ exactly, then we say that ‘a’ is a factor of ‘b’ and we write, a | b. In this case, ‘b’ is called a multiple of ‘a’.
☼ An Important Result : …