Question

By using Euclid's division algorithm find HCF of
305,793

Answer 1

Step-by-step explanation:

305,798= 30000050007008

Answer 2

this is the right answer of this question...

Step-by-step explanation:

since 793 > 305 ,we apply the division lemma to 793 and 305 to obtain :

793= 305 x 2 + 183

since remainder 183 is not equal to 0 , we apply the division lemma to 305 and 183 to obtain :

305 = 183 x 1 + 122

we consider the new divisor 183 and new remainder 122 , and apply the new division lemma to obtain

183 = 122 x 1 + 61

Now, the new divisor is 122 and new remainder is 61 , and apply the new division lemma to obtain

122 = 61 x 2 + 0

since the remainder is zero, the process stops

Also the divisor at this stage is 61,

Hence the HCF of 793 and 305 is 61.