Use Euclid 's division algorithm to find the Hcf of 196

1
but Euclid division algorithm is used when there is 2 no like 196,64.if there is 1 no we have to use hcf method
hmmmm
So would you plz tell us the missing part?
sure.... actually division algorithm is the easiest method let me take an ex of 196,64 1first u hav to take d greater no as dividend & smaller as divisor 196>64 now divide 64)196( u will get som ans then put divisor as dividend & quotient as divisor & divide go on d same until u get remainder =0 if u get r=0 then divisor is hcf. if u hav any doubt regarding dis u can ask me. thank u
sure.... actually division algorithm is the easiest method let me take an ex of 196,64 1first u hav to take d greater no as dividend & smaller as divisor 196>64 now divide 64)196( u will get som ans then put divisor as dividend & quotient as divisor & divide go on d same until u get remainder =0 if u get r=0 then divisor is hcf. if u hav any doubt regarding dis u can ask me. thank u.

Answers

2015-07-25T18:16:04+05:30
 As 38220>196.
Using Euclid’s division algorithm, 38220 = 196×195 + 0
The remainder is zero, so our procedure stops.
 Hence, HCF of 196 and 38220 is 196. 
0