Question

how to find HCF by Euclids algorithm

Answer 1

Here is an example for u.......

Answer 2

Hello dear friend !


Here is your answer
________________________________________________________________________


To find the HCF of a given number by using Euclid's division algorithm, we have to use Euclid's division Lemma. It is a proven statement to prove Euclid's division algorithm.


Let the 2 numbers be a and b

If a> b, then

a = bq+r, 0= or < r <b

q= quotient, r = reminder


So, lets take an example of 2 and 4

Here 4>2

so, a = 4 , b = 2

According to the Lemma,

a=bq+r
4= 2(2) + 0

Hence, HCF = 2