You can try to compute over ZZ with p added as a generator, because
J in Z^n/ ~= J + in Z^n
sage: p = next_prime(2^100)
sage: R. = ZZ[]
sage: I = Ideal(R.random_element() for _ in range(R.ngens()))
sage: I += [p]
sage: I.groebner_basis()
[x^2 + 380295180068468820449010961696*x*z + 253530
Hi!
On 2012-12-13, Santanu Sarkar wrote:
> When I want to calculate
> Groebner basis, I have following error.
>
>
> verbose 0 (3292: multi_polynomial_ideal.py, groebner_basis) Warning:
> falling back to very slow toy implementation.
This is not an error but a warning.
> P1=next_prime(2^100)
> R
