Section 1.2
Problem 1:
Solution:
We use Euclidean Algorithm,
a. (7469, 2464) = ?
7469 = 2464 (3) + 77
2464 = 77(32) + 0
=> g.c.d of 7469 and 2464 is 32
b. (2689, 4001) = ?
4001 = 2689 (1) + 1312
2689 = 1312 (2) + 65
1312 = 64 (20) + 12
64 = 12 (5) + 5
12 = 5(2) + 2
5 = 2 (2) + 1
2 = 1 (2) + 0
=> g.c.d of 7469 and 2464 is 1
c. (2947, 3997) = ?
3997 = 2947(1) + 1050
2947 = 1050 (2) + 847
1050 = 847 (1) + 203
847 = 203 (2) + 35
203 = 35 (5) + 28
35 = 28 (1) + 7
28 = 7 (4) + 0
=> g.c.d of 2947 and 3997 is 7
d. (1109, 4999) = ?
4999 = 1109 (4) + 563
1109 = 563 (1) + 546
563 = 546 (1) + 17
546 = 17 (20) + 6
17 = 6 (2) + 5
6 = 5 (1) + 1
5 = 1(5) + 0
=> g.c.d of 1109 and 4999 is 1