Yikes!
https://github.com/sagemath/sage/pull/66
On Tue, Nov 8, 2016 at 12:06 PM, Mathijs van de Nes
wrote:
> The function square_root_mod_prime from sage.rings.finite_rings.integer_mod
> may produce an incorrect result.
>
> Example:
> In [1]: mod(100, 5^7).sqrt()^2
>
The function square_root_mod_prime from sage.rings.finite_rings.integer_mod
may produce an incorrect result.
Example:
In [1]: mod(100, 5^7).sqrt()^2
Out[1]: 15725
In [2]: square_root_mod_prime_power(mod(100, 5^7), 5, 7)^2
Out[2]: 15725
The expected result is 100 instead of 15725.
Tracing the
I have improved the sparse multivariate factorization algorithm in giac
1.2.2-101, it will factor the given polynomial in about 2s. It is based on
a simple idea of comparing a few bivariate factorizations, it is explained
here https://hal.archives-ouvertes.fr/hal-01394062 in order to help other
On Tue, Nov 8, 2016 at 1:47 PM, Simon King wrote:
> Hi Martin,
>
> On 2016-11-08, 'Martin R' via sage-devel wrote:
>> That's actually precisely what I'd like. So, what are metaclass conflicts?
>
> Many classes in Sage have metaclasses, such
Hi Martin,
On 2016-11-08, 'Martin R' via sage-devel wrote:
> That's actually precisely what I'd like. So, what are metaclass conflicts?
Many classes in Sage have metaclasses, such as: Everything that inherits
from sage.structure.element.Element or from
That's actually precisely what I'd like. So, what are metaclass conflicts?
Martin
Am Dienstag, 8. November 2016 12:37:20 UTC+1 schrieb Erik Bray:
>
> On Tue, Nov 8, 2016 at 8:58 AM, 'Martin R' via sage-devel
> wrote:
> > Thanks for these hints! I'm afraid that I
On Tue, Nov 8, 2016 at 8:58 AM, 'Martin R' via sage-devel
wrote:
> Thanks for these hints! I'm afraid that I still have to go with Jeroen's
> solution, because I'd like to have different descriptions of the class, only
> what's displayed as "Init docstring" should be
On Mon, Nov 7, 2016 at 9:11 PM, Frédéric Chapoton wrote:
> If nobody else than me cares about *working* on the transition to py3, this
> is probably not going to happen anytime soon.
I very much care and I think it's critical for Sage's long-term
viability. It's not part
On Mon, 7 Nov 2016, Amritanshu Prasad wrote:
I implemented a new algorithm for checking if a directed graph with edge
labels is Cayley. It is sensitive to the edge labels, works only for
directed graphs, but is a much simpler algorithm overall.
Good.
Have you written documentation with some
I implemented a new algorithm for checking if a directed graph with edge
labels is Cayley. It is sensitive to the edge labels, works only for
directed graphs, but is a much simpler algorithm overall.
It is based on Didier Caucal's characterization
https://arxiv.org/abs/1609.08272 which says
10 matches
Mail list logo