-
# Motivation
In the process of writing https://github.com/haskell/core-libraries-committee/issues/40, I realised that the pairs of typeclass methods `toInteger`/`fromInteger` and `toRational`/`from…
-
The `SR.solve(..., to_poly_solve=True)` option does weird things:
```
sage: (x^7-x-1).solve(x, to_poly_solve=True)
[x == 1.11277569705, x == (0.617093477784 - 0.900864951949*I), x == (-0.8098578005…
-
This ticket does the following:
1. The current version of itensor (the Kronecker product on the ring of symmetric function) only works when the ground ring is an algebra over the rationals. This is…
-
Currently coercion of polyhedra with number fields does not work. The following results in a type error:
```
sage: z = QQ['z'].0
sage: K = NumberField(z^2 …
-
It seems a bug:
```
sage: bool(AA(sqrt(2))/pi == sqrt(2)/pi)
TypeError: ECL says: THROW: The catch MACSYMA-QUIT is undefined.
```
The following comparison is fine, though.
```
sage: bool(AA(sqrt(2…
-
If I run `puts current_time`, I get an output like
```
{run: 12, time: 0.0}
└─ (6955285408309949/4194304)
```
While the example in the help says it should look like `2017-03-19 23:37:57 +0000`.…
-
Right now to test if a Sage integer is prime it is faster to call `prime_range` rather than `.is_prime()`...
```
sage: timeit("bool(prime_range(121,122))", number=10000)
10000 loops, best of 3: 1.0…
-
Comparison of PARI rationals is seriously broken:
```
sage: pari(1/2) < pari(1/3)
True
sage: pari(1) < pari(1/2)
True
```
Furthermore,the following PARI series and *p*-adics are incorrectly conside…
-
Could you please add support for PG12?
Sadly the changes from PG11 to PG12 are too many for me to provide you with a proper patch: my C skills are not good enough.
I'd like to help testing the …
-
MPIR 3.0.0 is shipped with the function `mpq_cmp_z(mpq_t, mpz_t)`. We can use it to make integer/rational comparisons much faster.
Comparing integers is very fast, comparing rationals is very fast …