-
Given the coefficients of a polynomial $a_n x^n+...+a_1 x + a_0$, print its integer roots without repetitions in ascending order.
**Constraints**
$1≤n≤4$, $a_n≠0$, $\left\|a_k\right\| ≤64$ for all…
btnlq updated
2 weeks ago
-
Given a polynomial from ℚ[X], we need a better way to express its roots using radical expressions if such an expression is possible.
The current approach, as used by e.g. `NumberFieldElement._symbo…
-
Hi there,
First of all, I wanted to thank you for this well-documented code.
I am currently re-implementing the MAT package in Python based on your work.
I found a small bug in the [`allRoots`](h…
-
**Describe the solution you'd like**
`ulab` already has `polyfit()`, but not `Polynomial`.
I would like to see `Polynomial` implementing `Polynomial.fit()` and `Polynomial.roots()`, as well as `Po…
-
https://flintlib.org/doc/qqbar.html
-
This is related to https://github.com/oscar-system/Oscar.jl/issues/4007, and found together with @VictoriaSchleis @APMS04
```
julia> K,t = puiseux_series_field(QQ,10,"t")
(Puiseux series field in…
-
E.g. https://github.com/sympy/sympy/issues/22673.
```python
In [1]: p = Poly(x**7 - x, domain=FF(7))
In [2]: p.all_roots()
Out[2]:
⎡ 6 ___ 2/3 6 ___ 6 ___ 2/3 6 ___ …
-
### Steps To Reproduce
The following will cause exception in Sagemath:
```
solve( 2048*x^10 + 4096*x^9 + 4096*x^8 + 2560*x^7 + 1280*x^6 + 544*x^5 + 192*x^4 + 48*x^3 + 12*x^2 + 2*x + 1 == 0, x, to_p…
-
Imported from SourceForge on 2024-07-06 06:08:21
Created by **[macrakis](https://sourceforge.net/u/macrakis/)** on 2003-08-15 03:00:52
Original: https://sourceforge.net/p/maxima/bugs/384
---
The doc…
rtoy updated
2 months ago
-
For the five roots of the polynomial x^5-1, the representations only use integers and i and the operations of addition, subtraction, multiplication, division, and the extraction of roots, but for the …