Previous Up Next

10.9.13  GCD in ℤ/pℤ[x]

The gcd command finds the greatest common divisor of two polynomials with coefficients in ℤ/pℤ (for prime p). (See also Section 6.1.1 and Section 10.3.5.)

Example

gcd((2*x^2+5)%13,(5*x^2+2*x-3)%13)
     

1%13
x+2%13
          

Previous Up Next