Question

600 and 800find HCF use Euclid's division algorithm​

Answer 1

Answer:

Euclid's division lemma a=bq+r

The highest number here is 800

So,

800=600×1+200

600=200×3+0

So the HCF of 600,800=200.

plz mark it as the brainliest answer

Answer 2

$\huge \tt \it \bf \it \bm { \mathbb{ \fcolorbox{blue}{yellow}{ \red{ANSWER :}}}} \green\longrightarrow</p><p>$

by Euclid division lemma,

a=bq+r

• a=dividend
• b=divisor
• q=quotient
• r=remainder

by using Euclid division lemma,

$800 = 600 \times 1 + 200 \\ 600 = 200 \times 3 + 0$

since remainder becomes 0 so,

HCF of 600 and 800=200

____________________________

EUCLID DIVISION LEMMA:-

Euclid division lemma is a proven statement which is used for proving another statement .

a=bq+r

0≤r<b

a=dividend

b=divisior

q= quotient

r=remainder

___________________________

hops this may help you$\huge{ \purple{ \ddot{ \smile}}}$$\huge \blue{ \mathfrak{thanks♡}}$