Question

find the HCF of 100 and 1000 using euclids division algorithm​

Answer 1

Step-by-step explanation:

By applying Euclid’s division lemma on 190 and 100 we get,

190 = 100 x 1 + 90

Since remainder ≠ 0, apply division lemma on divisor

100 and remainder 90

100 = 90 x 1 + 10.

Since remainder ≠ 0, apply division lemma on divisor 90 and remainder 10 90 = 10 x 9 + 0

Therefore, H.C.F. of 100 and 190 is 10

Answer 2

I know I know

Step-by-step explanation:

by applying Euclid's division algorithm:

(a=bq+r)

100 & 1000

(*u should take greatest no. first so 1000)

1000=100

(then u should divide 1000 by 100 so 1000 will go from 10 so) & 100 10 za is 1000 when u minus it u get 0 as remainder.

1000 = 100 x 10 + 0

therefore, the HCF of 100 & 1000 is 100.

Answer:

100 & 1000

1000 = 100 x 10 + 0

=100

therefore, the HCF of 100 & 1000 is 100.