Question

division
algorithm
to
find
Euclid's
the
HCF of 56 and
Use
814​

Answer 1

Step-by-step explanation:

thank you for sending this to me

Answer 2

$\huge{\mathcal{\blue{\underline{\underline{\pink{HeYa!!!}}}}}}$

${\large{\purple{\mathbb{ANSWER}}}}$

☆ To find:-

• HCF(56,814) By Euclid's Divison Algorithm.

☆ So,

By Euclid's Divison Lemma we get,

${\large{\blue{\boxed{\bold{=》\:a\:=\:bq+r.}}}}}$

▪︎ Where,

$0 \leqslant r < b$

☆ Therefore,

▪︎ 814 = 56×14+30.

▪︎ 56 = 30×1+26.

▪︎ 30 = 26×1+4.

▪︎ 26 = 4×6+2.

▪︎ 4 = 2×2+0.

{Do these all above as a Divisions in notebook}

Therefore the required HCF of 56 and 814 is 4.

Hope this will help you if it HELPS then plz mark my answer as BRAINLIEST.

And remember to always keep a smile on face:)

$<marquee>✌✌THANKS✌✌</marquee>$