Blog
Euclidean Algorithm
No Comments
☼ 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 3 = 15 · (3) + 21 · (– 2) = 15 · (10) + 21 · (– 7)
