pith. sign in

arxiv: 1606.07334 · v3 · pith:6ZWVFTNYnew · submitted 2016-06-23 · 🧮 math.NT · math.CO

Partition regularity of generalised Fermat equations

classification 🧮 math.NT math.CO
keywords alphabetagammaequationmathbbalreadycolourcolouring
0
0 comments X
read the original abstract

Let $\alpha,\beta,\gamma\in\mathbb{N}$. We prove that given an $r$-colouring of $\mathbb{F}_p$ with $p$ prime, there are more than $c_{r,\alpha,\beta,\gamma} p^2$ solutions to the equation $x^\alpha+y^\beta=z^\gamma$ with all of $x,y,z$ of the same colour. Here $c_{r,\alpha,\beta,\gamma}>0$ is some constant depending on the number of colours and the exponents in the equation. This is already a new result for $\alpha=\beta=1$ and $\gamma=2$, that is to say for the equation $x+y=z^2$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.