Question

How to find HCF of any number by using Euclid division lemma all steps are mentioned

Answer 1

euclids division lemma states that given two positive integers a and b there exists a unique ger q and r satjsfying a =bq + r where 0 <_r <b

a =bq+r

let us suppose find the hcf of two humbers 6 and 12

let a = 12 and b be 6

by euclids diviosn lemma

12 = 6 ×2 +0

here the divisor is 6 and remainder is 0

if the remainder is 0 we stop the process.

if doesnt we should continue untill we get the remainder o

then in the last step the divisor is the hcf of that number

MARK IT AS BRAINLIEST

Answer 2

Euclid's division algorithm states that for any two positive integers m and n there exist a unique integers p and q such that m= np+q such that 0\leq q

Given numbers are 570 and 1425

1425=570\times 2+2851425=570×2+285

\570=285\times 2+0570=285×2+0

Since,we have obtained remainder 0, so hcf of 570 and 1425 is 285.

Division is shown in image attached below.