ALBUKHARY INTERNATIONAL UNIVERSITY

SCHOOL OF COMPUTING AND INFORMATICS

1.Find the greatest common divisor by using the Euclidean Algorithm.

Identify whether the integers are “relatively prime”.
a) gcd(24, 54)

To find the gcd of 24 and 54 using the Euclidean Algorithm, we divide the
larger number by the smaller number and take the remainder. We then divide
the smaller number by the remainder and take the new remainder. We repeat
this process until the remainder is zero. The last non-zero remainder is the
gcd.
54 ÷ 24 = 2 remainder 6
24 ÷ 6 = 4 remainder 0
Therefore, gcd ( 24, 54)= 6. And not relatively prime.
b) gcd(18, 42)
42 ÷ 18 = 2 remainder 6
18 ÷ 6 = 3 remainder 0
Gcd (18, 42) = 6 and not relatively prime.
c) gcd(128, 423)
423 ÷ 128 = 3 remainder 39
128 ÷ 39 = 3 remainder 10
39 ÷ 10 = 3 remainder 9
10 ÷ 9 = 1 remainder 1
9 ÷ 1 = 9 remainder 0
gcd (128, 423) = 1.
Since the gcd of 128 and 423 is 1, 128 and 423 are relatively prime.

d) gcd(1424, 3084)
3084 ÷ 1424 = 2 remainder 236
1424 ÷ 236 = 6 remainder 128
236 ÷ 128 = 1 remainder 108
128 ÷ 108 = 1 remainder 20
108 ÷ 20 = 5 remainder 8
20 ÷ 8 = 2 remainder 4
8 ÷ 4 = 2 remainder 0
Gcd(1424, 3084) = 4.

e) gcd(2415, 3289)

3289 ÷ 2415 = 1 remainder 874

2415 ÷ 874 = 2 remainder 667
874 ÷ 667 = 1 remainder 207
667 ÷ 207 = 3 remainder 46
207 ÷ 46 = 4 remainder 23
46 ÷ 23 = 2 remainder 0
gcd (2415, 3289) = 23

f) gcd(4278, 8602)
8602 ÷ 4278 = 2 remainder 46
4278 ÷ 46 = 93 remainder 0
Gcd (4278, 8602) = 46.

g) gcd(406, 555)

555 ÷ 406 = 1 remainder 149

406 ÷ 149 = 2 remainder 108
149 ÷ 108 = 1 remainder 41
108 ÷ 41 = 2 remainder 26
41 ÷ 26 = 1 remainder 15
26 ÷ 15 = 1 remainder 11
15 ÷ 11 = 1 remainder 4
11 ÷ 4 = 2 remainder 3
4 ÷ 3 = 1 remainder 1
3 ÷ 1 = 3 remainder 0
Gcd (406, 555) = 1.

2. Find the GCD of 126 and 231 using the Euclidean Algorithm.
231 ÷ 126 = 1 remainder 105
126 ÷ 105 = 1 remainder 21
105 ÷ 21 = 5 remainder 0
Therefore, the gcd of 126 and 231 is 21.

3. Use the Euclidean Algorithm to find the GCD of 312 and 468.

1. Divide the larger number, 468, by the smaller number, 312:

468 ÷ 312 = 1 remainder 156
Therefore, the GCD of 312 and 468 is 156.

4. If a = 453 and b = 675, what is the GCD of a and b using the Euclidean algorithm?

a = 453, b = 675
Step 1: 675 = 1 * 453 + 222 (remainder)
Step 2: 453 = 2 * 222 + 9 (remainder)
Step 3: 222 = 24 * 9 + 6 (remainder)
Step 4: 9 = 1 * 6 + 3 (remainder)
Step 5: 6 = 2 * 3 + 0 (remainder)
The last non-zero remainder is 3, so GCD(a, b) = 3.
Therefore, the GCD of 453 and 675 is 3.

5. Find the GCD of 84 and 144 using the Euclidean Algorithm.

144 ÷ 84 = 1 remainder 60
84 ÷ 60 = 1 remainder 24
60 ÷ 24 = 2 remainder 12
24 ÷ 12 = 2 remainder 0
Therefore, the gcd of 84 and 144 is 12.
6. Let a = 1024 and b = 1536. Using the Euclidean Algorithm, what is the GCD
of a and b?

find the gcd of a = 1024 and b = 1536 using the Euclidean Algorithm, we To divide
the larger number by the smaller number and take the remainder. We then divide the
smaller number by the remainder and take the new remainder. We repeat this
process until the remainder is zero. The last non-zero remainder is the gcd.
1536 ÷ 1024 = 1 remainder 512
1024 ÷ 512 = 2 remainder 0
Therefore, the gcd of 1024 and 1536 is 512.