Are monochromatic Pythagorean triples avoidable?
Résumé
A Pythagorean triple is a triple of positive integers a, b, c ∈ N-{0} satisfying a^2 + b^2 = c^2. Is it true that, for any finite coloring of N-{0}, at least one Pythagorean triple must be monochromatic? In other words, is the Diophantine equation X^2 +Y^2 = Z^2 regular? This problem has been open since several decades, even restricted to 2-colorings. In this note, we introduce partial morphisms, which are special colorings of N-{0} by finite groups with partly multiplicative properties. We show that, for many such colorings, monochromatic Pythagorean triples are impossible to avoid in the integer interval [1, 10000].
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...