Combinatorial principles in elementary number theory (Q1182430)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combinatorial principles in elementary number theory |
scientific article; zbMATH DE number 31201
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial principles in elementary number theory |
scientific article; zbMATH DE number 31201 |
Statements
Combinatorial principles in elementary number theory (English)
0 references
28 June 1992
0 references
It is shown that the theory \(\hbox{I}\Delta_ 0\;+\) weak version of the \(\Delta_ 0\)-Pigeonhole Principle proves the Lagrange four squares theorem. This answers positively a question of A. McIntyre (1986). The authors consider also the number-theoretical consequences of a new combinatorial principle called ``\(\Delta_ 0\)-Equipartition Principle'' \((\Delta_ 0 \hbox{EQ})\). In particular, a new proof (which can be formalized in \(\hbox{I}\Delta_ 0+\Delta_ 0 \hbox{EQ})\) of the fact that every prime of the form \(4n+1\) is the sum of two squares is given.
0 references
weak \(\Delta_ 0\)-pigeonhole principle
0 references
\(\hbox{I}\Delta_ 0\)
0 references
Lagrange four squares theorem
0 references
combinatorial principle
0 references
\(\Delta_ 0\)- equipartition principle
0 references
0.93639684
0 references
0.92185944
0 references
0.91978943
0 references