Changes the methods decompose(Ideal), minimalPrimes(Ideal), and isPrime(Ideal)
i1 : installMinprimes() minimalPrimes Ideal, decompose Ideal, and isPrime Ideal have been re-installed to use experimental code |
i2 : R = ZZ/32003[a..e] o2 = R o2 : PolynomialRing |
i3 : I = ideal"a2b-c3,abd-c2e,ade-ce2" 2 3 2 2 o3 = ideal (a b - c , a*b*d - c e, a*d*e - c*e ) o3 : Ideal of R |
i4 : C = minprimes I; |
i5 : C1 = minimalPrimes I; |
i6 : C == C1 o6 = true |
i7 : netList C +---------------------------+ o7 = |ideal (c, a) | +---------------------------+ | 2 3 | |ideal (e, d, a b - c ) | +---------------------------+ |ideal (e, c, b) | +---------------------------+ |ideal (d, c, b) | +---------------------------+ |ideal (d - e, b - c, a - c)| +---------------------------+ |ideal (d + e, b - c, a + c)| +---------------------------+ |
i8 : C/isPrime o8 = {true, true, true, true, true, true} o8 : List |
This function will eventually go away, once this is no longer experimental code