Euclid Division Algorithm
Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b.Real number ( H. C. F ): Euclid Division Lemma is a part of the Euclid Division Algorithm and it is the best method to find H. C. F between two no.’s
Click Here to get the Video Link of Number System By Lalit Sir.
WOW just what I was looking for. Came here by searching for online books to read for
free pdf