arXiv (All)
open access
An elementary proof of the 2-regularity of Pythagorean triples
We give a new proof of the fact that every 2-coloring of the positive integers contains a monochromatic Pythagorean triple. This result was originally proven by Heule, Kullmann, and Marek with SAT solvers in 2016, answering a decades-old question of Graham. This proof uses elementary techniques and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A new proof of two-color partition regularity of Pythagorean triples#1128935
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#652365
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#650912
- K3 surfaces over small number fields and Kummer constructions in families#984869
- Non-Separable Homothetic Triangles, Part I: Constructions and Lower Bounds#974672
Record · ID 1144030
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive