Cannonball problem

A square pyramid of cannonballs in a square frame

In the mathematics of figurate numbers, the cannonball problem asks which numbers are both square and square pyramidal. Equivalently, which squares can be represented as the sum of consecutive squares, starting from 1?

When cannonballs are stacked within a square frame, the number of balls is a square pyramidal number; Thomas Harriot gave a formula for this number around 1587, answering a question posed to him by Sir Walter Raleigh on their expedition to America.[1] Édouard Lucas formulated the cannonball problem as a Diophantine equation

or

and conjectured that the only solutions are N = 1, M = 1, and N = 24, M = 70. It was not until 1918 that G. N. Watson found a proof for this fact, using elliptic functions. The result has relevance to the bosonic string theory in 26 dimensions.[2] More recently, elementary proofs have been published.[3][4]

Although it is possible to tile a geometric square with unequal squares, it is not possible to do so with a solution to the cannonball problem. The squares with side lengths from 1 to 24 have areas equal to the square with side length 70, but they cannot be arranged to tile it.

See also

References

  1. ↑ David Darling. "Cannonball Problem". The Internet Encyclopedia of Science.
  2. ↑ "week95". Math.ucr.edu. 1996-11-26. Retrieved 2012-01-04.
  3. ↑ Ma, D. G. (1985). "An Elementary Proof of the Solutions to the Diophantine Equation ". Sichuan Daxue Xuebao. 4: 107–116.
  4. ↑ Anglin, W. S. (1990). "The Square Pyramid Puzzle". American Mathematical Monthly. 97 (2): 120–124. JSTOR 2323911. doi:10.2307/2323911.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.