References:
************************************** ***Undergrad Student Homework*** Geddes et al (Read pp 32 - 37) (1) Write a Maple procedure, called My_iEEA that implements the Extended Euclidean Algorithm on the integers (2) Use My_iEEA to compute the multiplicative inverse of 23 mod 511 (3) Write a Maple procedure, called My_EEA() that implements the Extended Euclidean Algorithm on the polynomial ring Q[x], where Q denotes the field of rational numbers. (4) Use My_EEA to compute the multiplicative inverse of 1 + x + x^{2} mod 1 + x + x^{7} *************************************** *** Grad Student Homework*** (1) Do (3) and (4) of the undergrad homework (2) Then answer the following questions in Cox et al: 5, p66 1, p78 7, p78 8, p78 ***************************************