Jump to content

Talk:Fermat polygonal number theorem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 19:35, 1 February 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Note

[edit]

Does anybody know a proof or a sketch of the proof of this theorem to be added in this article? Or is there a proof available online? --Matikkapoika 20:02, 8 November 2005 (UTC)[reply]

The references now have two references to Nathanson's proof.

Accuracy

[edit]

The article about Lagrange's Four Square Theorem says he proved the case of squares in 1770, not 1772.

Sketchy statement

[edit]

I don't like the phrasing of this theorem: "Every positive integer is a sum of at most n n-polygonal numbers". Clearly 4 = 1 + 1 + 1 + 1 is a counterexample by that 1 is a 3-gonal number. It should be more like "Expressing any positive integer as a sum requires at most n n-gonal numbers."

Yup, fixed.  Done RobHar (talk) 04:17, 21 April 2011 (UTC)[reply]