# Differentia

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.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation
view all courses
RELATED QUESTIONS :

Euclid divided hiNCERT Mathematics Exemplar

Thales belongs toRS Aggarwal & V Aggarwal - Mathematics

Boundaries of surNCERT Mathematics Exemplar

In Indus Valley CRS Aggarwal & V Aggarwal - Mathematics

The number of intRS Aggarwal & V Aggarwal - Mathematics

In ancient India,RS Aggarwal & V Aggarwal - Mathematics

A, B and C are thRS Aggarwal & V Aggarwal - Mathematics

A point C lies beRS Aggarwal & V Aggarwal - Mathematics

Given 4 distinct RS Aggarwal & V Aggarwal - Mathematics