-
**How should OSCAR offer "probably correct" computations?**
**Q:** Why?
**A:** Because sometimes a "probably correct" result can be obtained much faster. For example
```
n = factorial(ZZ(3…
-
I get the following error:
```
poly = sympy.Poly(sympy.minimal_polynomial(expr))
File "venv-sympy/lib/python3.8/site-packages/sympy/polys/numberfields/minpoly.py", line 701, in minimal_poly…
-
This ticket implements a citation tracking system for Sage which can give fine grained information on the algorithms and implementations used for a specific computation.
This is in contrast to the c…
-
Here is how attributes are passed to libsingular when calling a singular function:
```
sage: from sage.libs.singular import singular_function
sage: P.=QQ[]
sage: J = P*[P.random_element() for _ in …
-
```
In [1]: Poly(t**2 + I, t, domain='ZZ[sqrt(-1)]')
Out[1]: Poly(t**2 + I, t, domain='ZZ[I]')
In [2]: Poly(t**2 + sqrt(2), t)
Out[2]: Poly(t**2 + 2**(1/2), t, domain='EX')
In [3]: Poly(t**2 + I, t)…
-
Hi,
The `groebner` returns the unique Reduced Gröbner bases by default, for any ordering, correct? Then why does the example below NOT have leading coefficient 1 ? This is an example from the docum…
-
The complexity of the solution one gets from `solve` and `nonlinsolve` for a series of equations depends on the order that the variables are presented. Would it be better to make the result canonical?…
-
```
Here is the original problem:
>>> var('lam a0 conc')
(lam, a0, conc)
>>> eqs = [lam+2*y-a0*(1 - x/2)*x-0.005*x/2*x, a0*(1 - x/
... 2)*x-1*y-0.743436700916726*y, x+y-conc]
>>> …
-
While working on #8623 I got this example:
```
In [1]: primitive_element([I*sqrt(2*sqrt(2) + 3), I*sqrt(-2*sqrt(2) + 3), I], ex=True)
~/src/sympy/sympy/polys/numberfields.py in primitive_element(ex…
-