What is the smallest positive integer for which the congruent number problem is unsolved?

Question

The congruent number problem is the problem of figuring out whether a given positive integer $N$ is the area of a right-angled triangle with all side lengths rational. According to Dickson's "History of the theory of numbers" (volume 2 chapter 16) the problem was explicitly raised in an anonymous Arab manuscript which dates back to 972AD or before. Some relatively straightforward algebra shows that $N$ is a congruent number iff the elliptic curve $E_N:=y^2=x^3-N^2x$ has positive (algebraic) rank.

Tunnell in 1983 gave a relatively efficient algorithm for computing the special value of the $L$-function of $E_N$ at 1 (I don't know how efficient it is in practice but it's certainly going to run in time polynomial in $N$ which I know is atrocious if $N$ is very large, however I think our problems are going to start before then). If the value of this $L$-function at 1 is non-zero then by the Coates-Wiles theorem the curve has algebraic rank zero and hence $N$ is not congruent. If BSD is true then Tunnell's algorithm gives a necessary and sufficient condition for $N$ to be congruent.

However BSD is not yet known, and my guess is that as $N$ increases, the fact that we don't know BSD for $E_N$ will trouble us before Tunnell's algorithm starts slowing up. In theory there could exist some $N$ for which $E_N$ had analytic rank 2 or more, and algebraic rank zero. Tunnell would compute the special value at 1 to be zero and then we would be faced with the problem of computing the algebraic rank, which can very occasionally be hard in practice, especially if Sha is non-trivial etc etc. Even if the algebraic rank is positive, finding a non-torsion point can be hard in practice; the question is like Pell where relatively innocuous values of $N$ like 157 can give rise to elliptic curves for which the height of every non-torsion point is very large. In fact general theory can deal with 157 because the analytic rank is 1, but certainly the analytic rank can be higher than 1 in general (for example if $N=41$ then the analytic rank is 2).

Because of this issue, I think that (until a new major advance is made with this problem) there must surely be some explicit smallest positive integer $N$ for which we don't know whether or not $N$ is a congruent number. My guess is that this value of $N$ will actually be a congruent number in practice, and the elliptic curve $E_N$ will be computationally checked to have analytic rank at least 2, but no-one will be able to find a rational point (not because there isn't one, but because it's out of computational range).

My guess is that there will be papers containing results of the form "we have solved the congruent number problem for all $N\leq 10^{10}$" or some such statement -- but I have no idea what the state of the art is, and perhaps my google-fu is weak today. This does not change the fact that I am giving a talk on the congruent number problem tomorrow :-) and I thought that it might be nice to mention the state of the art, if I can find it out by then! Does anyone have any leads?

Answer 1

Kazuo Matsuno writes (personal communication):

"I verified (10 years ago) by using mwrank and magma that E_N:y^2=x^3-N^2x has a non-torsion point if N<=10^6 is congruent to 1,2,3 modulo 8 and the analytic rank of E_N is positive. For all N<=10^6 congruent to 5,6,7 modulo 8, Elkies proved rank(E_N)>0.

http://arxiv.org/abs/math/0208056 "

If no-one can better this, then the answer to my question is hence $10^6+2$ (given that I (KB) just checked $10^6+1$ earlier today).

Answer 2

This is a practical question rather than a theoretical one. My suspicion is that the smallest $N$ for which it is not feasible to determine whether $N$ is congruent is probably very large (maybe $N \approx 10^{9}$), for the following reason.

The curve $E_{N} : y^{2} = x^{3} - N^{2} x$ has CM, and as a consequence $\mathbb{Q}(E_{N}[\ell])/\mathbb{Q}$ is a much smaller extension than it would be otherwise. This makes it feasible to do higher descents on $E_{N}$. In particular, running a 3-descent on $E_{N}$ is feasible, and combining this with a 4-descent, one can write down 12-covers of $E_{N}$ explicitly using Magma, and then point search on them. To give one an idea of what is feasible in this manner, I computed a generator for $E_{N}(\mathbb{Q})$ with $N = 1508233$ (the curve has rank $1$) that has canonical height $1234$. The total computation time was about $90$ minutes.

If the analytic rank of $E_{N}$ is $\geq 2$ (and BSD is true), then in order for a curve to resist this approach, it would have to have rank $\geq 2$ and all of its generators have large canonical height. This suggests the regulator would have to be of size about $10^{6}$.

Note: There is some possibility that the harder cases would be those where the analytic rank is $1$. Once $N$ is large enough, the conductor of $E_{N}$ is big enough that computing $L'(E,1)$ becomes very time consuming (for $N = 1348439$ it takes about $5$ hours or so to compute $L'(E,1)$ and verify it is nonzero). However, something that could be tried in these cases would be to run the Heegner point method described by Elkies in his 1994 paper "Heegner Point Computations" (in the first ANTS proceedings). This is much better than the "standard one", and uses the fact that $E_{1} \cong X_{0}(32)$. If $N = 956693$, $E_{N}$ has rank one, and a generator has canonical height $1692$. I found this generator by using a variant of Elkies's method in 18 minutes.