-
Following #7239, use the factorization of Cunningham numbers to speed up polynomial primitivity testing and other finite field stuff (for small characteristic).
Depends on #12133
CC: @jpflori @rw…
-
This code
```
from sympy import *
minpoly(root(2,3)+root(3,3)+(-1+I*sqrt(3))/2*root(5,3))
```
doesn't terminate.
-
I have no idea how to go about this in a general way, but currently break-up fraction isn't very smart.
For example, `(2x+3)/(2x+2)` simplifies to `2 x / (2 x + 2) + 3 / (2 x + 2)`, which is argua…
-
As reported on [this ask question](https://ask.sagemath.org/question/57796/bug-polynomial-variable-name-matters/) :
```
P. = ProjectiveSpace(QQbar, 2)
f = a^3 + z^3
C = Curve(f)
g = (a + y)^3 + z^3…
-
From this paper:
http://www.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf
Should we skip this and just implement the even-more optimized algorithms of DJB?
leto updated
10 years ago
-
### Discussed in https://github.com/sympy/sympy/discussions/22848
Originally posted by **mariogeiger** January 12, 2022
Hi,
I have `sympy 1.9` installed and I try to solve the following sys…
-
TEST
-
```
./msieve 768531568949864434127663356968791171529040243295495438880404231239694778363287943773447372497 -v
Msieve v. 1.54 (SVN Unversioned directory)
Fri Oct 18 16:25:37 2024
random seeds: …
-
When trying to run the test set for p = 2 and n = 4, the code is really slow and seems to be hanging on computing the splitting fields. It might be worth to reconsider the way these are generated now.…
-
**Motivation**
Since I contributed the NSIS component in 2014, its RegEx patterns have been optimized by other contributors. I'm not entirely sure about the motivation for these (better performance? …