Euclid’s division algorithm as the name suggest, has to do with divisibility of integers. It says that any positive integer ‘a’ can be divided by another positive integer ‘b’ in such a way that it leaves a remainder ‘r’ that is smaller than b. This result has many applications related to the divisibility properties of integers. It is used mainly to complete the HCF of two positive integers.

Read More...