Ask Your Question
0

(bug report) polynomial ring over large prime

asked 2026-03-05 10:20:16 +0100

pg261 gravatar image

Try:

p= next_prime(1000)  # or some other prime
R.<x,y>= GF(p)[]
pol= 18*x
print(pol/x)

When $p$ is small, this correctly prints 18. However, when p is at least 536870923 (the first prime after $2^{29}$), this prints 18*x/x, the fraction is not simplified.

I'm on sage 10.8 installed this morning.

edit retag flag offensive close merge delete

Comments

This is not simplified, but not false.

FrédéricC gravatar imageFrédéricC ( 2026-03-06 08:34:31 +0100 )edit

This is not false, but R(pol/x) does crash.

pg261 gravatar imagepg261 ( 2026-03-13 09:32:16 +0100 )edit

1 Answer

Sort by » oldest newest most voted
0

answered 2026-03-05 22:38:53 +0100

Max Alekseyev gravatar image

updated 2026-03-05 22:47:25 +0100

If you replace pol/x with pol//x, then over a large field you'll see an error:

NotImplementedError: Division of multivariate polynomials over prime fields with characteristic > 2^29 is not implemented.

I'm not sure whether pol/xshould raise the same error, but you're welcome to file a bugreport at https://github.com/sagemath/sage/issues anyway.

See also https://github.com/sagemath/sage/issu...

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

Stats

Asked: 2026-03-05 10:20:16 +0100

Seen: 95 times

Last updated: Mar 05