Saved Bookmarks
| 1. |
Find hcf (10000,100000) using euclids division algorithm |
|
Answer» Answer: 10000 Step-by-step explanation: 100000>10000 according to euclid's DIVISION algorithm a=bq+r where 0 ≤ r < b 100000=1000(10)+0 since remainder is 0 10000 is the HCF if u find it helpful PLEASE mark it as BRAINLIEST |
|