• cannonball problem

cannonball problem (suomeksi)

Määritelmät:

• (lb, en, math) The challenge of proving that the only solution of the Diophantine equation :$\backslash sum\_\{n=1\}^\{N\}\; n^2\; =\; M^2\backslash ;$ with ''N'' > 1 is when ''N'' = 24 and ''M'' = 70.