Question

Hcf of 50,60 by Euclid division lemma

Answer 1

Answer:

Step-by-step explanation:

Euclid's lemma

a=bq+r

Therefore

60=50×1+10

50=10×5+0

Therefore HCF is 10

Answer 2

HCF of 50 and 60 is 10

1) if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b which is normally called remainder theorem.

2) so here is the way to solve the HCF by Euclid division lemma

60 = 50×1 + 10.

50 = 10×5 + 0.

According to the division lemma the last divisor of the steps is the highest common factor of the given two numbers.