Saved Bookmarks
| 1. |
explain euclids divison lemma |
|
Answer» Euclid division lemma method is based on formula of Dividend = Divisor × Quotient + Remainder It is similar method to division method but in this only we use a formula given above . And finally last Divisor is our hcf . The basis of euclidean division alogorithm is eculids divison lema. To calculate the HCF of two positive integer we use eculids division algorithm. HCF is largest no which exactly divides two or more positive integer |
|