Question

find euclid division lemma for 1000 and 56

Answer 1

Answer:

Step-by-step explanation:

given numbers are 1000 and 56.

BY EUCLIDS DIVISON LEMMA

        given two positive integers a and b there exists a unique integer q and r satisfying a = bq + r.  0 is greater than or equal to r and greater than b.

                           A = BQ + R

let a = 1000 and b = 56

by euclids division lemma

1000 =  56 ×17 + 48

since the remainder is not zero we continue the process

now a = 56 and b = 48

56 =  48 × 1 + 8

since the remainder is not zero again we cotinue the process

now a = 48 and b =8

48= 8× 6 + 0

since here the reminder is zero we stop the process

the divisior in the last step is the hcf of two numbers

THE HCF OF TWO NUMBERS IS 6.

MARK IT AS BRAINLIEST ANSWER PLS

Answer 2

Answer:

6 is the HCF

Step-by-step explanation:

hurry up time is less