A) Employ the Extended Euclidean algorithm to find an inverse of 55 modulo 144. (answer between 1 and 143)
B) Modify the result from the first part of this problem to compute an inverse of 144 modulo 55. (Your answer should be between 1 and 54.)
C) Solve the recurrence a0 = 1, an = 2(a^3)n-1 for n>=1
D) Solve the system of congruences:
x "is the same as" 1 (mod 2)
x "is the same as" 2 (mod 3)
x "is the same as" 3 (mod 5)