In: Computer Science
Problem Solving Set #1 (10 pts each) a. Find the multiplicative inverse of 1234 in GF(4321) using the extended Euclidean algorithm b. Does the multiplicative inverse of 24140 in GF(40902) exist? Prove your answer. c. Is x4 + 1 irreducible over GF(2)? Prove your answer. d. Find (x3 + x + 1)-1 in GF(24 ) mod x4 + x + 1 using the extended Euclidean algorithm e. Find (x3 + x + 1)-1 in GF(28 ) mod x8 + x4 + x3 + x + 1 using the extended Euclidean algorithm
Hope this helps:).For 4th and 5th part, please clarify once in the comment section that it is 24 and 28 instead of 24 and 28. On getting the clarification, I will edit my answer and submit my solution for those parts as well. Feel free to discuss any other doubt too in the comment section.