Question

using euclidean algorithm find the hcf of 765 and 65

Answer 1

HCF=5

Hope this helps!!

Answer 2

Here is the solution :

Euclid division lemma or algorithm states that, If there are two numbers a,b then there exists q,r such that, a = bq + r, 0<=r<b,

Now,
the two numbers are 765 and 65,
=> a = 765(Since larger number is always taken as a)
=> b = 65,

=> 765 = 65*11 + 50
=> 65 = 50*1 + 15,
=> 50 = 15*3 + 5,
=> 15 = 5*3 + 0,

Therefore : 5 is the H.C.F by Euclid's Algorithm !

Hope you understand, Have a great day !
Thanking you, Bunti 360 !!
=