Question

8840 and 23120 find hcf by euclied

Answer 1

Following the Euclid algorithm:

23120 = 8840 × 2 + 5440
8840 = 5440 × 1 + 3400
5440 = 3400 ×1 + 2040
3400 = 2040 × 1 + 1360
2040 = 1360 × 1 + 680
1360 = 680 × 2 + 0

680 is the GCD .

Answer 2

$\huge \bf{HEY \: FRIENDS!!}$


-------------------------------------------------------



$\huge \bf \underline{Here \: is \: your \: answer↓}$


⬇⬇⬇⬇⬇⬇⬇⬇⬇⬇⬇⬇⬇⬇



▶⏩ Find the HCF by Euclid's Division lemma:-)

↪➡ 23120 and 8840.


$\huge \boxed{ By \: Euclid's \: Division \: lemma}$

$\huge \underline{a = bq + r.}$


▶⏩ Here a = 23120
and b = 8840.
q = quotient.
r = remainder.


▶⏩ Now, according to Euclid's Division lemma:-)

$\bf = > 23120 = 8840 \times 2 + 5440.$

$\bf = > 8840 = 5440 \times 1 + 3400.$


$\bf = > 5440 = 3400 \times 1 + 2040.$


$\bf = > 3400 = 2040 \times 1 + 1360.$


$\bf = > 2040 = 1360 \times 1 + 680.$


$\bf = > 1360 = 680 \times 2 + 0.$


$\huge \bf \boxed{HCF = 680.}$



✔✔ Hence, HCF by Euclid's Division lemma is finded.✅✅


$\huge \boxed{THANKS}$


$\huge \bf \underline{Hope \: it \: is \: helpful \: for \: you}$