The powmod function computes  where a and b are polynomials in x and n is an integer, possibly negative.  The case of n positive could also be computed as  but powmod is more efficient and uses the method of binary powering with remainder.