Question

using Euclid's algorithm find the HCF of 10005and9269​

Answer 1

Answer:

kvkhvgfcddhecfgiokookitdythybunj

Answer 2

what I feel, the easiest way to get the answer is by using Euclid's division lemma

Euclid's division says that,

a=bq+r ( where a and b are the numbers and b>r>0)

Let's put the numbers

10,005=9269*1+736

9269=736*12+437

736=437*1+299

437=299*1+138

299=138*2+23

138=23*6+0

Therefore, the h.c.f(10,005 , 9269)=23

Hope you understand.

Wishing good luck for future:).

Hope you have satisfied with this answer.So please follow me and thank me and make me as brainliest soon and vote my answer.