-
Notifications
You must be signed in to change notification settings - Fork 57
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
In non-euclidean ZZ[:x]
, calls to gcdx
result in infinite loop
#1474
Comments
mathematically, the gcd is well defined in ZZx as it is a UFD, but the gcdx is not possible in ZZx for this example, we have |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Accidentally somewhere in my code, I called
gcdx
for polynomials inZZ[:x]
instead ofQQ[:x]
. This led to my tests not terminating 😞 Here some example code:Is this non-terminating behavior intended?
In AbstractAlgebra instead, the call to
divrem(x, 2)
ingcdx
fails, while in Nemo it gives(0, x)
.Confusingly, both AbstractAlgebra and Nemo compute
gcd(x, x+2)
as1
.The text was updated successfully, but these errors were encountered: