Skip to main content

100 is the only square that is the sum of 4 consecutive (positive) cubes.

The OEIS article on the number 100 opens with an interesting factoid: 

"100 is the square of 10, and the smallest square that is the sum of four [positive] consecutive cubes: 13+23+33+43=100."

In fact, it is the only one. To see this, let's look at the equation

y2=x3+(x+1)3+(x+2)3+(x+3)3=4x3+18x2+42x+36.

Let X=4x+6,Y=4y; the above equation then reduces to

Y2=X3+60X.

Note that a positive integer solution in (x,y) will give a positive integer solution in (X,Y), though the converse is not true.

Now, generally speaking, whenever one sees an equation of the form Y2=X3+aX+b, one has an elliptic curve. Well, we have the extra condition 4a3+27b20 to get rid of problematic cases like y2=x3, which are referred to as singular curves; we'll see the logic of this later on. I will not go too deeply into specifics here, as that is not quite the objective of this post, but elliptic curves are the object of much study in modern number theory. The website L-Functions and Modular Forms Database (LMFDB) contains information about many elliptic curves over Q and some other number fields. This specific elliptic curve is indeed on LMFDB, with label 14400.cq2; the integral points (X,Y) are given by

(0,0),(6,±24),(10,±40),(240,±3720).

Not all of these correspond to positive integer points (x,y) in the original equation; only (10,40), which corresponds to (1,10), does. This completes the proof of the claim.

(Yes, I am aware I can submit this to the OEIS Wiki. I have indeed put in an edit for it with this reasoning attached several months ago, but it has not been reviewed.)


It's natural to ask, of course, about n consecutive cubes summing to a square for other values of n? We have the identity

13+23++n3=(1+2++n)2,

which has a few nice proofs here. Does this happen otherwise? The above shows that for n=4, it does not. The case n=1 is a bit of an anomaly here, as you just have all the perfect sixth powers; elliptic curve methods do not work and are not needed here, here, because you get y2=x3,  which fails the nonsingularity condition 4a3+27b20.

More generally, as Stroeker outlines here, starting with the equation

y2=x2+(x+1)2++(x+n1)2=nx3+32n(n1)x2+n(n12)(n1)x+14n2(n1)2

the change of variables X=nx+12n(n1),Y=ny turns this into

Y2=X3+14n2(n21).

One can check that, just like before, if x,y are integers, so are X,Y.

A similar analysis for n=2, which I'll leave to the reader, yields that indeed the only square that is the sum of two consecutive cubes is 32=13+23. But, n=3 is a bit more interesting. We have the curve Y2=X3+18X, which has two integral points that give us positive integer solutions. Aside from the point (6,18), which recovers the typical solution, the point (72,612) gives us

2042=233+243+253

which Cassels showed, using some basic algebraic number theory, is indeed is the last solution of its kind. Indeed, we can confirm Cassels' result by looking this curve up on LMFDB.

In general, does it ever happen that a perfect square is a sum of n consecutive cubes infinitely often? The answer, for n>1, is no. This is because by a theorem of Siegel, elliptic curves over Q (and number fields in general) have only finitely many integral points.

Comments

Popular posts from this blog

A silly little derivation of ζ(2)

(This is a cleaned-up and somewhat expanded version of this Twitter thread .) What follows is a silly little proof that ζ(2)=n=11n2=π26 where ζ is the Riemann zeta function. Consider the integral I:=01log(1x+x2)x(x1)dx. We have, by using partial fractions and performing some other algebraic manipulations, I=01log(1x+x2)xdx01log(1x+x2)1xdx=201log(1x+x2)x(x1x)=2(01log(1+x)xdx01log(1+x3)xdx)=4301log(1+x)xdx(xx1/3). To evaluate this integral, we take the Maclaurin series: 01log(1+x)xdx=01n=1(1)nxn1ndx ...

On infinite decimal expansions, missing numbers, and generating functions

(This post is a cleaned up and expanded version of this thread .) A cool fact I've seen shared around the internet   a few times : The decimal expansion of 1/998001 starts with 1998001=0.000001002003996997999 That is, it begins with three-digit strings from 000 to 999, in order, except that it skips 998 for some reason. The first thing to observe is that 998001=9992. Recall the formula for the infinite geometric series: n=0rn=11r. If we differentiate both sides with respect to r, we get n=1nrn1=1(1r)2, and multiplying by r gives n=1nrn=r(1r)2. (This can also be obtained by some series manipulations.) Now, take r=0.001. We have 0.001(10.001)2=1000998001=0.001+0.000002+0.000000003+ From here, the appearance of the numbers from 001 to \( 997...