Does the Diophantine equation,

first suggested by Swinnerton-Dyer, only have a finite number of *primitive* solutions? Note that, by *Sophie Germain’s identity*, the RHS factors as,

Before discussing (1), we can compare it to other quartic Diophantine equations. Any primitive integral solution to,

must obey the congruential constraint that there is an addend such that either {} is divisible by . The smallest was found by Norrie in 1911 as,

and indeed,

On the other hand, for,

Morgan Ward proved the added constraint that either {*c+d, -c+d*} is divisible by . The smallest was found by Roger Frye in 1988,

and we can see that,

Going back to the Swinnerton-Dyer equation, the only solution less than a hundred million () is,

found by A. Elsenhans and J. Jahnel in 2004. On a hunch, I decided to test the values and found that,

I don’t know if this is a general congruence valid to all primitive solutions of (1), and an email to the authors revealed neither did they. In fact, to quote their paper, “.*.. it is unknown whether this equation admits ﬁnitely or inﬁnitely many primitive solutions. If their number were actually ﬁnite then this would settle a famous open problem in the arithmetic of K3 surfaces…*”

So many questions, so little time.

### Like this:

Like Loading...

*Related*