Saved Bookmarks
| 1. |
use euclid ,s algorithm to find hcf (196,38220) |
|
Answer» 38220>196 we always divide greater number with smaller one.Divide 38220 by 196 then we get quotient 195 and no remainder so we can write it as38220 = 196 * 195 + 0As there is no remainder so deviser 196 is our HCF 2+2 |
|