Differentiate between Euclid's lemma and algorithm.

Euclid’s lemma is a lemma that captures a fundamental property of prime numbers. It is basically a proven statement used for proving another statement.

Euclid’s lemma states that,

Let a and b be any two positive integers. Then there exist two unique whole numbers q and r such that

a = b q + r,

where 0 ≤ r < b

Here, a is called the dividend,

b is called the divisor,

q is called the quotient and

r is called the remainder.

While Algorithm is just a series of well-defined steps which gives a procedure for solving a type of problems.

Using a set of algorithms, we can find the highest common factor of two numbers and here, we use Euclid’s lemma.