Question

find hcf of 54and26 by algorithm division lemma

Answer 1

$\underline{\mathfrak{Solution :}}$

$\underline\bold{Euclid's\:\:Division\:\: Lemma\:\:or\:\:Algorithm}$

For any positive odd integer, a and b are integer there exists integer q and r such that

a = bq + r where r < 0

$a = dividend \\ \\ b = divisor \\ \\ q = quotient \\ \\ r = remainder$

$\underline{Question}$

$\textbf{Using Euclid's Division Lemma, find the HCF of 54 and 26}$

By Euclid's Division Lemma

a = bq + r where r < 0

For a = 54 b = 26

54 = 26 ×2 + 2 ( r # 0 )

For a = 26 b = 2

26 = 2 × 13 + 0 ( r = 0 )

HCF [54 and 26] = 2

$\textbf{Hope it helps!!!}$

Answer 2

$\underline \bold{Solution:-}$



Since , 54 > 26

therefore, 54 = 26 × 2 + 2

26 = 2 × 13 + 0


HCF = 2

$\huge \bold {Answer = 2}$