Answer:
See step-by-step explanation below
Step-by-step explanation:
This problem is solved using the Euclidean algorithm; to prove that the integers 8n + 3 and 5n + 2 are relative prime we have to prove that:
gcd(8n + 3, 5n + 2) = 1
gcd (8n + 3, 5n + 2) = gcd (3n + 1, 5n + 2) = gcd (3n + 1, 2n + 1) = gcd(n, 2n + 1) = gcd(n,1) = 1
⇒gcd(8n + 3, 5n + 2) = 1
2^2 ( 1,2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12) = 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44,48
3^2(1,2,3, 5) = 9, 18, 27, 45
5^2(1, 2) = 25, 50
7^2 = 49
19 numbers
126
d and e
