A060950 -id:A060950 - cp's OEIS frontend

A081119 Number of integral solutions to Mordell's equation y^2 = x^3 + n.

5, 2, 2, 2, 2, 0, 0, 7, 10, 2, 0, 4, 0, 0, 4, 2, 16, 2, 2, 0, 0, 2, 0, 8, 2, 2, 1, 4, 0, 2, 2, 0, 2, 0, 2, 8, 6, 2, 0, 2, 2, 0, 2, 4, 0, 0, 0, 2, 2, 2, 0, 2, 0, 2, 2, 2, 6, 0, 0, 0, 0, 0, 4, 5, 8, 0, 0, 4, 0, 0, 2, 2, 12, 0, 0, 2, 0, 0, 2, 8, 2, 2, 0, 0, 0, 0, 0, 0, 8, 0, 2, 2, 0, 2, 0, 0, 2, 2, 2, 12

Offset: 1

T. D. Noe, Mar 06 2003

Mordell's equation has a finite number of integral solutions for all nonzero n.
Gebel, Petho, and Zimmer (1998) computed the solutions for |n| <= 10^4. Bennett and Ghadermarzi (2015) extended this bound to |n| <= 10^7.
Sequence A054504 gives n for which there are no integral solutions. See A081120 for the number of integral solutions to y^2 = x^3 - n.
a(n) is odd iff n is a cube. - Bernard Schott, Nov 23 2019
From Jianing Song, Aug 24 2022: (Start)
a(n) = 5 if n is a sixth power. Further more, if A060950(n) = 0 (namely the elliptic curve y^2 = x^3 + n has rank 0), then:
- a(n) = 2 if n is a square but not a sixth power;
- a(n) = 1 if n is a cube but not a sixth power;
- a(n) = 0 otherwise.
This follows from the complete description of the torsion group of y^2 = x^3 + n, using O to denote the point at infinity (see Exercise 10.19 of Chapter X of Silverman's Arithmetic of elliptic curves):
- If n = t^6 is a sixth power, then the torsion group consists of O, (2*t^2,+-3*t^3), (0,+-t^3), and (-t^2, 0).
- If n = t^2 is not a sixth power, then the torsion group consists of O and (0,+-t).
- If n = t^3 is not a sixth power, then the torsion group consists of O and (-t,0).
- If n is of the form -432*t^6, then the torsion group consists of O and (12*t^2,+-36*t^3).
- In all the other cases, the torsion group is trivial.
So a torsion point on y^2 = x^3 + n other than O is an integral point. If y^2 = x^3 + n has rank 0, then all the integral points on y^2 = x^3 + n are exactly the torsion points other than O.
Note that this result implies particularly that a(n) = a(n*t^6) for all t if A060950(n) = 0: the elliptic curve y^2 = x^3 + n*t^6 can be written as (y/t^3)^2 = (x/t^2)^3 + n, so it has the same Mordell-Weil group (hence the same rank and isomorphic torsion group) as y^2 = x^3 + n. (End)

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, page 191.
J. Gebel, A. Petho and H. G. Zimmer, On Mordell's equation, Compositio Mathematica 110 (3) (1998), 335-367.

Jean-François Alcover, Table of n, a(n) for n = 1..10000 [There were errors in the previous b-file, which had 10000 terms contributed by T. D. Noe and was based on the work of J. Gebel.]
Michael A. Bennett, Amir Ghadermarzi Mordell's equation: a classical approach. LMS J. Compute. Math. 18 (2015): 633-646. doi:10.1112/S1461157015000182 arXiv:1311.7077
J. Gebel, Integer points on Mordell curves, web.archive.org copy of the "MORDELL+" file on the SIMATH web site shut down in 2017. [Locally cached copy].
J. Gebel, A. Pethö and H. G. Zimmer, On Mordell's equation, Compositio Math. 110 (1998), 335-367. (doi:10.1023/A:1000281602647 not working as of July 2024.)
Joseph H. Silverman, The Arithmetic of Elliptic Curves.
Eric Weisstein's World of Mathematics, Mordell Curve.
Wikipedia, Mordell curve.

Cf. A054504, A081120. See A134108 for another version.

(* This naive approach gives correct results up to n = 1000 *) xmax[] = 10^4; Do[xmax[n] = 10^5, {n, {297, 377, 427, 885, 899}}]; Do[xmax[n] = 10^6, {n, {225, 353, 618 }}]; f[n] := (x = -Ceiling[n^(1/3)]-1; s = {}; While[x <= xmax[n], x++; y2 = x^3 + n; If[y2 >= 0, y = Sqrt[y2]; If[ IntegerQ[y], AppendTo[s, y]]]]; s); a[n_] := (fn = f[n];  If[fn == {}, 0, 2 Length[fn] - If[First[fn] == 0, 1, 0] ]); Table[an = a[n]; Print["a[", n, "] = ", an]; an, {n, 1, 100}] (* Jean-François Alcover, Oct 18 2011 *)

Edited by Max Alekseyev, Feb 06 2021

A060838 Rank of elliptic curve x^3 + y^3 = n.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 2, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 0, 1, 1, 1, 0, 2, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1

Offset: 1

Noam Katz (noamkj(AT)hotmail.com), May 02 2001

The elliptic curve X^3 + Y^3 = D*Z^3 where D is a rational integer has a birationally equivalent form y^2*z = x^3 - 2^4*3^3*D^2*z^3 where x = 2^2*3*D*Z, y = 2^2*3^3*D*(Y - X), z = X + Y (see p. 123 of Stephens). Taking z = 1 and 2^2*3^3 = 432 yields y^2 = x^3 - 432*D^2, which is the Weierstrass form of the elliptic curve used by John Voight in the Magma program below. - Ralf Steiner, Nov 11 2017

Zagier and Kramarz studied the analytic rank of the curve E: x^3 + y^3 = m, where m is cubefree. They computed L(E,1) for 0 < m <= 70000 and also L'(E,1) if the sign of the functional equation for L(E,1) was negative. In the second case the range was only 0 < m <= 20000. - Attila Pethő, Posting to the Number Theory List, Nov 11 2017

John Voight and Joseph L. Wetherell, Table of n, a(n) for n = 1..10000
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 1<=n<=200 (text in Japanese)
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 201<=n<=500 (text in Japanese)
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 501<=n<=1000 (text in Japanese)
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 1001<=n<=1500 (text in Japanese)
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 1501<=n<=2000 (text in Japanese)
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 2001<=n<=2500 (text in Japanese)
...
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 8501<=n<=9000 (text in Japanese)
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 9001<=n<=9500 (text in Japanese)
Nakao Hisayasu, Tables of the rank and rational points for the elliptic curve x^3 + y^3 = n for n cubefree, 9501<=n<=10000 (text in Japanese)
N. M. Stephens, The Diophantine equation X^3 + Y^3 = D Z^3 and the conjectures of Birch and Swinnerton-Dyer, J. Reine Angew. Math. 231 (1968), 121-162.
D. Zagier and G. Kramarz, Numerical investigations related to the L-series of certain elliptic curves, J. Indian Math. Soc. 52 (1987), 51-60 (the Ramanujan Centenary volume).

Cf. A060748 (positions of records in this sequence), A060950.

seq := [];
M := 10000;
for m := 1 to M do
E := EllipticCurve([0,-432*m^2]);
Append(~seq, Rank(E));
end for;
seq;
// John Voight, Nov 02 2017

{a(n) = ellanalyticrank(ellinit([0, 0, 0, 0, -432*n^2]))[1]} \\ Seiichi Manyama, Aug 25 2019

Many thanks to Andrew V. Sutherland, John Voight, and Joseph L. Wetherell, who all responded to my request for additional terms for this sequence. - N. J. A. Sloane, Nov 01 2017

A060953 Rank of elliptic curve y^2 = x^3 + n*x.

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 2, 2, 1, 0, 1, 0, 2, 1, 0, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 1, 0, 2, 1, 0, 0, 0, 1, 1, 0, 2, 0, 2, 2, 1, 2, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 2, 1, 0, 1, 1, 2, 1, 0, 0, 1, 2, 1, 1, 0, 0, 1, 2

Offset: 1

N. J. A. Sloane, May 10 2001

Seiichi Manyama, Table of n, a(n) for n = 1..1000
H. Mishima, Tables of Elliptic Curves
F. Richman, Elliptic curves
K. Rubin and A. Silverberg, Ranks of elliptic curves

Cf. A060748, A060838, A060950-A060953.

{ A060953(n) = ellanalyticrank( ellinit([0,0,0,n,0]) )[1]; }

a(-n) = A060952(n). - Michael Somos, Dec 15 2011

Lambert Klasen (Lambert.Klasen(AT)gmx.net), Mar 31 2005, kindly rechecked this sequence against the Mishima web site and found no errors.
Corrected Apr 10 2005 at the suggestion of James R. Buddenhagen. There were errors caused by the fact that Mishima lists each curve of rank two twice, once for each generator.
Extended by Max Alekseyev, Mar 09 2009

A002155 Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.

Original entry on oeis.org

15, 17, 24, 37, 43, 57, 63, 65, 73, 79, 89, 101, 106, 122, 129, 131, 142, 145, 148, 151, 161, 164, 168, 171, 186, 195, 197, 198, 204, 217, 222, 223, 225, 229, 232, 233, 248, 252, 260, 265, 268, 269, 281, 294, 295, 297, 303, 322, 331, 337, 347, 350, 353, 360, 366, 369, 373, 377, 381, 388, 389, 392, 404, 409, 412, 414, 433, 449, 464, 469, 481, 483, 485, 492

Offset: 1

N. J. A. Sloane

nonn

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..1724 (using Gebel)
B. J. Birch and H. P. F. Swinnerton-Dyer, Notes on elliptic curves, I, J. Reine Angew. Math., 212 (1963), 7-25.
J. Gebel, Integer points on Mordell curves, web.archive.org copy of the "MORDELL+" file on the SIMATH web site shut down in 2017. [Locally cached copy].
L. Lehman, Elliptic Curves of Rank Two. [broken link]
H. Mishima, Tables of Elliptic Curves.

Cf. A060950, A002151, A002153, A102833, A060748, A060838, A060951-A060953.

for k in[1..500] do if Rank(EllipticCurve([0,0,0,0,k])) eq 2 then print k; end if; end for; // Vaclav Kotesovec, Jul 07 2019

More terms from James R. Buddenhagen, Feb 18 2005

A002151 Numbers k for which rank of the elliptic curve y^2 = x^3 + k is 0.

Original entry on oeis.org

1, 4, 6, 7, 13, 14, 16, 20, 21, 23, 25, 27, 29, 32, 34, 42, 45, 49, 51, 53, 59, 60, 64, 70, 75, 78, 81, 84, 85, 86, 87, 88, 90, 93, 95, 96, 104, 109, 114, 115, 116, 123, 124, 125, 135, 137, 140, 144, 153, 157, 158, 159, 160, 162, 165, 167, 173, 175, 176, 178

Offset: 1

N. J. A. Sloane

nonn

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..2907 (using Gebel)
B. J. Birch and H. P. F. Swinnerton-Dyer, Notes on elliptic curves, I, J. Reine Angew. Math., 212 (1963), 7-25.
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
L. Lehman, Elliptic Curves of Rank Zero.
H. Mishima, Tables of Elliptic Curves.

Cf. A060950, A002153, A002155, A102833, A060748, A060838, A060951, A060952, A060953.

for k in[1..200] do if Rank(EllipticCurve([0,0,0,0,k])) eq 0 then print k; end if; end for; // Vaclav Kotesovec, Jul 07 2019

Corrected and extended by James R. Buddenhagen, Feb 18 2005

The missing entry 123 was added by T. D. Noe, Jul 24 2007

A031507 a(n) = smallest k>0 such that the elliptic curve y^2 = x^3 + k has rank n, or -1 if no such k exists.

Original entry on oeis.org

1, 2, 15, 113, 2089, 66265, 1358556

Offset: 0

Noam D. Elkies

See A031508 for the smallest negative k. - Artur Jasinski, Nov 21 2011
See A060950 for the rank of y^2 = x^3 + n. - Jonathan Sondow, Sep 10 2013
Gebel, Pethö, & Zimmer: "One experimental observation derived from the tables is that the rank r of Mordell's curves grows according to r = O(log |k|/|log log |k||^(2/3))." Hence this fit suggests a(n) >> exp(n (log n)^(1/3)) where >> is the Vinogradov symbol. - Charles R Greathouse IV, Sep 10 2013
The curves for k and -27*k are isogenous (as Noam Elkies points out---see Womack), so they have the same rank. - Jonathan Sondow, Sep 10 2013
Womack (2003) gives further upper bounds: a(7) <= 47550317, a(8) <= 1632201497, a(9) <= 185418133372, a(10) <=  68513487607153. - M. F. Hasler, Jul 01 2024
The three questions for arbitrary k, positive k, and negative k are not very far from each other because the curves for k and -27k are related by a 3-isogeny and therefore have the same rank. It would be most natural to ask for the minimal |k| for k of either sign [see A373795]. - Noam D. Elkies,  Jul 02 2024
a(16) <= 1160221354461565256631205207888 (Elkies, ANTS-XVI, 2024). The same article also establishes the existence of a value of k which has rank >= 17. - N. J. A. Sloane, Jul 05 2024

			a(12) <= 27*A031508(12) <= 27*6533891544658786928 = 176415071705787247056 (from Quer 1987 and Womack). - _Jonathan Sondow_, Sep 10 2013

Noam D. Elkies, Rank of an elliptic curve and 3-rank of a quadratic field via the Burgess bounds, 2024 Algorithmic Number Theory Symposium, ANTS-XVI, MIT, July 2024.

J. E. Cremona, Elliptic Curve Data
Noam D. Elkies and Zev Klagsbrun, New rank records for elliptic curves having rational torsion, ANTS XIV—Proceedings of the Fourteenth Algorithmic Number Theory Symposium, 233-250. Mathematical Sciences Publishers, Berkeley, CA, 2020.
J. Gebel, Integer points on Mordell curves, web.archive.org copy of the "MORDELL+" file on the SIMATH web site shut down in 2017. [Locally cached copy].
J. Gebel, A. Pethö and H. G. Zimmer, On Mordell's equation, Compositio Math. 110 (1998), 335-367. (doi:10.1023/A:1000281602647 not working as of July 2024.)
J. Quer, Corps quadratiques de 3-rang 6 et courbes elliptiques de rang 12, C. R. Acad. Sc. Paris I, 305 (1987), 215-218.
Tom Womack, Explicit Descent on Elliptic Curves, PhD thesis, University of Nottingham, July 2003.
Tom Womack, Minimal-known positive and negative k for Mordell curves of given rank (personal web page, latest available snapshot on web.archive.org from Jan. 2017), last modified Oct. 2002.

Cf. A031508, A373795.

{A031507(n)=for(k=1, oo, ellrank(ellinit([0, k]))[1]==n && return(k))} \\ Use ellanalyticrank() for PARI version < 2.14. - M. F. Hasler, Jul 01 2024

a(n) <= 27*A031508(n) and A031508(n) <= 27*a(n). - Jonathan Sondow, Sep 10 2013

Definition clarified by Jonathan Sondow, Oct 26 2013

Escape clause added to definition by N. J. A. Sloane, Jun 29 2024, because, as John Cremona reminds me, it is not known if k always exists.

A060951 Rank of elliptic curve y^2 = x^3 - n.

Original entry on oeis.org

0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 2, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 2, 1, 0, 0, 1, 1, 1, 0, 2, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 0, 1, 1, 2, 0, 0, 0, 1, 1, 0, 1, 1, 2, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 0, 2

Offset: 1

N. J. A. Sloane, May 10 2001

The curves for n and -27*n are isogenous (as Noam Elkies points out--see Womack), so they have the same rank. - Jonathan Sondow, Sep 10 2013

			a(1) = A060950(27) = a(729) = 0. - _Jonathan Sondow_, Sep 10 2013

T. D. Noe, Table of n, a(n) for n = 1..10000 (from Gebel)
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
H. Mishima, Tables of Elliptic Curves
T. Womack, Minimal-known positive and negative k for Mordell curves of given rank

Cf. A031508, A002150, A002152, A002154, A179136, A179137.
Cf. A060748, A060838, A060950, A060952, A060953.
Cf. A081120 (number of integral solutions to Mordell's equation y^2 = x^3 - n).

{a(n) = if( n<1, 0, length( ellgenerators( ellinit( [ 0, 0, 0, 0, -n], 1))))} /* Michael Somos, Mar 17 2011 */

apply( {A060951(n)=ellrank(ellinit([0,-n]))[1]}, [1..99]) \\ For version < 2.14, use ellanalyticrank(...). - M. F. Hasler, Jul 01 2024

a(n) = A060950(27*n) and A060950(n) = a(27*n), so a(n) = a(729*n). - Jonathan Sondow, Sep 10 2013

Corrected Apr 08 2005 at the suggestion of James R. Buddenhagen. There were errors caused by the fact that Mishima lists each curve of rank two twice, once for each generator.

A002153 Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 1.

Original entry on oeis.org

2, 3, 5, 8, 9, 10, 11, 12, 18, 19, 22, 26, 28, 30, 31, 33, 35, 36, 38, 39, 40, 41, 44, 46, 47, 48, 50, 52, 54, 55, 56, 58, 61, 62, 66, 67, 68, 69, 71, 72, 74, 76, 77, 80, 82, 83, 91, 92, 94, 97, 98, 99, 100, 102, 103, 105, 107, 108, 110, 111, 112, 117, 118, 119

Offset: 1

N. J. A. Sloane

nonn

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..5111 (using Gebel).
B. J. Birch and H. P. F. Swinnerton-Dyer, Notes on elliptic curves, I, J. Reine Angew. Math., 212 (1963), 7-25.
J. Gebel, Integer points on Mordell curves, web.archive.org copy of the "MORDELL+" file on the SIMATH web site shut down in 2017. [Locally cached copy].
H. Mishima, Tables of Elliptic Curves.

Cf. A060950, A002151, A002155, A102833, A060748, A060838, A060951-A060953.

for k in[1..200] do if Rank(EllipticCurve([0,0,0,0,k])) eq 1 then print k; end if; end for; // Vaclav Kotesovec, Jul 07 2019

Corrected and extended by James R. Buddenhagen, Feb 18 2005

A060952 Rank of elliptic curve y^2 = x^3 - n*x.

Original entry on oeis.org

0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 2, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 3, 0, 1, 1, 1, 1, 0, 1, 2, 0, 0

Offset: 1

N. J. A. Sloane, May 10 2001

Seiichi Manyama, Table of n, a(n) for n = 1..1000
H. Mishima, Tables of Elliptic Curves

Cf. A060748, A060838, A060950-A060953.

{a(n) = ellanalyticrank(ellinit([0, 0, 0, -n, 0]))[1]} \\ Seiichi Manyama, Sep 16 2018

Corrected Apr 08 2005 at the suggestion of James R. Buddenhagen. There were errors caused by the fact that Mishima lists each curve of rank two twice, once for each generator and each curve of rank three thrice.

A102833 Numbers n for which rank of the elliptic curve y^2=x^3+n is 3.

Original entry on oeis.org

113, 141, 316, 346, 359, 427, 443, 506, 537, 568, 659, 681, 730, 745, 873, 892, 899, 940, 997, 1016, 1025, 1090, 1149, 1157, 1171, 1213, 1304, 1305, 1342, 1367, 1373, 1478, 1522, 1639, 1646, 1737, 1753, 1772, 1811, 1841, 1897, 1907, 1954, 2024, 2143

Offset: 1

James R. Buddenhagen, Feb 18 2005. Entry revised by N. J. A. Sloane, Jun 10 2012

nonn

T. D. Noe, Table of n, a(n) for n=1..250 (using Gebel).
B. J. Birch and H. P. F. Swinnerton-Dyer, Notes on elliptic curves, I, J. Reine Angew. Math., 212 (1963), 7-25.
J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
H. Mishima, Tables of Elliptic Curves

Cf. A060950, A002151, A002153, A002155, A060748, A060838, A060951-A060953.

for k in[1..2000] do if Rank(EllipticCurve([0,0,0,0,k])) eq 3 then print k; end if; end for; // Vaclav Kotesovec, Jul 07 2019

More terms from T. D. Noe, Jul 24 2007

cp's OEIS Frontend

A081119 Number of integral solutions to Mordell's equation y^2 = x^3 + n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Extensions

A060838 Rank of elliptic curve x^3 + y^3 = n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

PARI

Extensions

A060953 Rank of elliptic curve y^2 = x^3 + n*x.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

Extensions

A002155 Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Extensions

A002151 Numbers k for which rank of the elliptic curve y^2 = x^3 + k is 0.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Extensions

A031507 a(n) = smallest k>0 such that the elliptic curve y^2 = x^3 + k has rank n, or -1 if no such k exists.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

Formula

Extensions

A060951 Rank of elliptic curve y^2 = x^3 - n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI

Formula

Extensions

A002153 Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 1.