Cannonball Problem

DOWNLOAD Mathematica Notebook

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to solving the Diophantine equation

 sum_(i=1)^ki^2=1/6k(1+k)(1+2k)=N^2

for some pyramid height k.

The only solutions are (k,N)=(1,1) and (24,70) (Ball and Coxeter 1987, Dickson 2005), as conjectured by Lucas (1875), partially proved by Moret-Blanc (1876) and Lucas (1877), and proved by Watson (1918). Watson's proof was almost elementary, disposing of most cases by elementary means, but resorting to the use of elliptic functions for one pesky case. Entirely elementary proofs have been given by Ma (1985) and Anglin (1990).

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.