Fermat polygonal number theorem
From Free net encyclopedia
Every positive integer is a sum of at most <math>n</math> <math>n</math>-polygonal numbers.
An example of triangular number case would be 17 = 10 + 6 + 1.
A well-known special case of this is Lagrange's four-square theorem, which states that every positive number can be represented as a sum of four squares, for example, 7 = 4 + 1 + 1 + 1.
Joseph Louis Lagrange proved the square case in 1770 and Gauss proved the triangular case in 1796, but the theorem was not resolved until it was finally proven by Cauchy in 1813. Nathanson's proof (see the references) is based on the following lemma due to Cauchy:
For odd positive integers <math>a</math> and <math>b</math> such that <math>b^2<4a</math> and <math>3a<b^2+2b+4</math> we can find nonnegative integers <math>s,t,u</math> and <math>v</math> such that <math>a=s^2+t^2+u^2+v^2</math> and <math>b=s+t+u+v.</math>
The theorem may not be best possible: see Pollock octahedral numbers conjecture.
References
- Eric W. Weisstein. "Fermat's Polygonal Number Theorem." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/FermatsPolygonalNumberTheorem.html
- Nathanson, M. B. "A Short Proof of Cauchy's Polygonal Number Theorem." Proc. Amer. Math. Soc. 9, 22-24, 1987.