On May 14, 'Reimundo Heluani' via sage-devel wrote:
On May 14, 'Reimundo Heluani' via sage-devel wrote:
On May 14, Daniel Loughran wrote:
Ha that is quite a funny mistake. The outputs of my experiments start to make
more sense now.
Does this also explain the error I found when working modulo 1
On May 14, 'Reimundo Heluani' via sage-devel wrote:
On May 14, Daniel Loughran wrote:
Ha that is quite a funny mistake. The outputs of my experiments start to make
more sense now.
Does this also explain the error I found when working modulo 16? Just this was
slightly different in nature.
On Th
On May 14, Daniel Loughran wrote:
Ha that is quite a funny mistake. The outputs of my experiments start to make
more sense now.
Does this also explain the error I found when working modulo 16? Just this was
slightly different in nature.
On Thursday, 14 May 2020 16:17:59 UTC+1, Reimundo Heluani
Ha that is quite a funny mistake. The outputs of my experiments start to
make more sense now.
Does this also explain the error I found when working modulo 16? Just this
was slightly different in nature.
On Thursday, 14 May 2020 16:17:59 UTC+1, Reimundo Heluani wrote:
>
> On May 14, Daniel Lough
On May 14, Daniel Loughran wrote:
Hello. I think that I may have found a bug involving elliptic curves modulo
powers of primes. I have attached the working jupyter notebook, but my code and
results are also below.
In my code I have an elliptic curve E over Q with good reduction at 2 and the
poin
I think your comment further indicates that there seems to be a serious
problem with how elliptic curves modulo primes powers are implemented in
sage.
Just in case anyone is in doubt, note that sage is perfectly happy to deal
with this point correctly if I define my curve as a plane projective
On May 14, Daniel Loughran wrote:
I don't follow you; given a rational point on an elliptic curve you can always
take its reduction modulo any integer.
The equation of the projective curve is:
Y^2*Z + Y*Z^2 = X^3 - X*Z^2
When you plug in (X:Y:Z) = (2:1:0), all terms involving Z vanish, so you
I don't follow you; given a rational point on an elliptic curve you can
always take its reduction modulo any integer.
The equation of the projective curve is:
Y^2*Z + Y*Z^2 = X^3 - X*Z^2
When you plug in (X:Y:Z) = (2:1:0), all terms involving Z vanish, so you
are left with the equation
0 = 2^
On May 14, 'Reimundo Heluani' via sage-devel wrote:
On May 14, Daniel Loughran wrote:
Hello. I think that I may have found a bug involving elliptic curves modulo
powers of primes. I have attached the working jupyter notebook, but my code and
results are also below.
In my code I have an elliptic
On May 14, Daniel Loughran wrote:
Hello. I think that I may have found a bug involving elliptic curves modulo
powers of primes. I have attached the working jupyter notebook, but my code and
results are also below.
In my code I have an elliptic curve E over Q with good reduction at 2 and the
poin
Hello. I think that I may have found a bug involving elliptic curves modulo
powers of primes. I have attached the working jupyter notebook, but my code
and results are also below.
In my code I have an elliptic curve E over Q with good reduction at 2 and
the point P = (2:-3:8) (homogeneous coord
11 matches
Mail list logo
