Saved Bookmarks
| 1. |
THINK AND DiscussCan you find the HCF of 1.2 and 0.127 Justify your answer.Euclid's algorithm is useful for calculating the HCF of very large numbersiest examples of an algorithm that a computer had been programmed |
|
Answer» Answer: i THINK it may help you.. Step-by-step explanation: Euclid's DIVISION lemma:Given positive integers a and b ,there exist UNIQUE pair of integers q and R SATISFYING a=bq+r, o<r<b |
|