Saved Bookmarks
| 1. |
7, Use Euclid division algorithm to find whether the following pair of niumbers is co primes105, 147 |
|
Answer» Step 1. Divide the larger number by the smaller one:147 ÷ 105 = 1 + 42; Step 2. Divide the smaller number by the above operation's remainder:105 ÷ 42 = 2 + 21;Step 3. Divide the remainder from the step 1 by the remainder from the step 2:42 ÷ 21 = 2 + 0;At this step, the remainder is zero, so we stop:21 is the number we were looking for, the last remainder that is not zero.This is the greatest common factor (divisor). gcf, gcd (105; 147) = 21;coprime numbers (relatively prime) (105; 147)? No. |
|