Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Fermat polygonal number theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==History== [[File:Eureka Gauss.png|thumb|[[Gauss's diary]] entry related to sum of triangular numbers (1796)]] The theorem is named after [[Pierre de Fermat]], who stated it, in 1638, without proof, promising to write it in a separate work that never appeared.<ref name="heath">{{harvtxt|Heath|1910}}.</ref> [[Joseph Louis Lagrange]] proved the [[Lagrange's four-square theorem|square case]] in 1770, which states that every positive number can be represented as a sum of four squares, for example, {{nowrap|1=7 = 4 + 1 + 1 + 1}}.<ref name="heath"/> [[Carl Friedrich Gauss|Gauss]] proved the triangular case in 1796, commemorating the occasion by writing in [[Gauss's diary|his diary]] the line "[[Eureka (word)|ΞΞ₯Ξ‘ΞΞΞ!]] {{nowrap|1=num = Ξ + Ξ + Ξ}}",<ref>{{citation|last=Bell|first=Eric Temple|authorlink=Eric Temple Bell|contribution=Gauss, the Prince of Mathematicians|editor-last=Newman|editor-first=James R.|title=The World of Mathematics|volume=I|pages=295β339|publisher=[[Simon & Schuster]]|year=1956}}. Dover reprint, 2000, {{ISBN|0-486-41150-8}}.</ref> and published a proof in his book [[Disquisitiones Arithmeticae]]. For this reason, Gauss's result is sometimes known as the '''Eureka theorem'''.<ref>{{citation | last1 = Ono | first1 = Ken | last2 = Robins | first2 = Sinai | last3 = Wahl | first3 = Patrick T. | doi = 10.1007/BF01831114 | mr = 1336863 | issue = 1β2 | journal = [[Aequationes Mathematicae]] | pages = 73β94 | title = On the representation of integers as sums of triangular numbers | volume = 50 | year = 1995| s2cid = 122203472 }}.</ref> The full polygonal number theorem was not resolved until it was finally proven by [[Cauchy]] in 1813.<ref name="heath"/> The proof of {{harvtxt|Nathanson|1987}} is based on the following lemma due to Cauchy: For odd positive integers {{mvar|a}} and {{mvar|b}} such that {{math|''b''<sup>2</sup> < 4''a''}} and {{math|3''a'' < ''b''<sup>2</sup> + 2''b'' + 4}} we can find nonnegative integers {{mvar|s}}, {{mvar|t}}, {{mvar|u}}, and {{mvar|v}} such that {{math|1=''a'' = ''s''<sup>2</sup> + ''t''<sup>2</sup> + ''u''<sup>2</sup> + ''v''<sup>2</sup>}} and {{math|1=''b'' = ''s'' + ''t'' + ''u'' + ''v''}}.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)