Question

Answer with process​

Answer 1

❤❤нєяє ιѕ тує αиѕωєя❤❤

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 !

❤❤∂ιν❤❤

Answer 2

$\huge\boxed{\texttt{\fcolorbox{purple}{pink}{Heya !!!}}}$

$<font color=green> Question:-$

HCF (765,65) BY EUCLID'S DIVISION ALGORITHM.

$<font color=blue> ANSWER:-$

I)

$a = 765 \: and \: b = 65$

$765 = 65 \times 11 + 50$

II)

$a = 65 \: and \: b = 50$

$65 = 50 \times 1 + 15$

III)

$a = 50 \: and \: b = 15$

$50 = 15 \times 3 + 5$

IV)

$a = 15 \: and \: b = 5$

$15 = 5 \times 3 + 0$

HENCE HCF (765,65)=5

HOPE IT HELPS...

.

.

.

HIT THANKS

MARK BRAINLIEST

AND FOLLOW ME