We'll start on this assignment in class, finish
it at home.
Copy the procedures my_igcdex and my_quo_rem to another worksheet. Rename
my_igcdex into my_gcdex, and modify it so that it will do the Extended Euclidean
Algorithm not in the integers Z but in the
polynomials Q[x].
Then, like inverse_mod_p in the worksheet,
use it to write a procedure inverse_mod_f where f is
a polynomial in Q[x].
Use your inverse_mod_f to calculate 1/(x3+5)
modulo x4+7x-9.
Then compare your result with Maple. Note: to do this comparison
type:
If you have the book Modern Computer Algebra, then read:
Introduction, Chapters 1-4, and sections 5.1 - 5.5 in Chapter 5. This contains
useful additional information.