up previous next
MinPolyModular

minimal polynomial with modular method

Syntax 
  MinPolyModular(f: RINGELEM, I: IDEAL, z: RINGELEM, MinPolyFunc: FUNCTION): RINGELEM
  MinPolyModular(f: RINGELEM, I: IDEAL, z: RINGELEM, MinPolyFunc: FUNCTION, primes: LIST): RINGELEM

Description
This function returns the minimal polynomial of the element f in the indeterminate z computed via modular approach (CRT). (see MinPolyQuotDef, MinPolyQuotElim, MinPolyQuotMat ). The second form uses the given list of primes (useful to create examples to make it fail ;-).

Example 
/**/ use QQ[x,y];
/**/ I := ideal(x^3-5,y^2-3);
/**/ f := x+y;
/**/ MinPolyModular(f, I, x, MinPolyQuot);
1: prime is 32009
2: prime is 32027
x^6 -9*x^4 -10*x^3 +27*x^2 -90*x -2

See Also