Saved Bookmarks
| 1. |
Use Euclid division algorithm to find the HCF of 900and 270 |
| Answer» Euclid\'s division lemma :Let a and b be any two positiveintegers .Then there exists twounique whole numbers q and rsuch thata = bq + r ,0 ≤ r < bNow ,\xa0900 and 270 , start with the larger\xa0integer , that is 900. Apply theDivision lemma , we get900 = 270 × 3 + 90270 = 90 × 3 + 0The remainder has now become zero . Now our procedure stops.Since the divisor at this stage is 90.Therefore ,HCF ( 900 , 270 ) = 90\xa0 | |