OpenAlex ·

A new proof of two-color partition regularity of Pythagorean triples

James Leng

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.34676
Original
Read it at the publisher
Topics
CombinatoricsGeometric TopologyNumber Theory

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.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Combinatorics

Get the few papers worth your time in Combinatorics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics