PreprintCC BY 4.0arXiv
A new proof of two-color partition regularity of Pythagorean triples
Abstract
We give a new proof that if the natural numbers are colored in two colors, then there exists a monochromatic Pythagorean triple. The proof was found by ChatGPT Astra.
Related
- An elementary proof of the 2-regularity of Pythagorean triples
- Pythagorean triples in level sets of completely multiplicative functions
- Proof of two conjectures on the log-concavity of partition ranks and cranks
- A Combinatorial Proof of Partition Identities for the Number of Distinct Part Sizes
- Proof of Almkvist's conjecture on the unimodality of partition polynomials
BibTeX
@misc{leng2026proof,
title = {{A new proof of two-color partition regularity of Pythagorean triples}},
author = {James Leng},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.34676},
eprint = {2609.34676},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.34676},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A new proof of two-color partition regularity of Pythagorean triples
AU - James Leng
PY - 2026
DA - 2026/09/28
PB - arXiv
DO - 10.48550/arxiv.2609.34676
UR - https://arxiv.org/abs/2609.34676
AB - We give a new proof that if the natural numbers are colored in two colors, then there exists a monochromatic Pythagorean triple. The proof was found by ChatGPT Astra.
ER -