Saved Bookmarks
| 1. |
Find the H.C.F. of 252525 and 363636. |
|
Answer» To find the HCF of 252525 and 363636 by using Euclid’s Division algorithm. 363636 = 252525 x 1 + 111111 The remainder 111111 ≠ 0 By division of Euclid’s algorithm 252525 = 111111 x 2 + 30303 The remainder 30303 ≠ 0 Again by division of Euclid’s algorithm 111111 = 30303 x 3 + 20202 The remainder 20202 ≠ 0 Again by division of Euclid’s algorithm. 30303 = 20202 + 10101 The remainder 10101 ≠ 0 Again by division of Euclid’s algorithm. 20202 = 10101 x 2 + 0 The remainder is 0 ∴ The H.C.F. is 10101 |
|