monochromatic solution to $xy=z$

414 Views Asked by At

Is it true that for any $k \geq 2$, there is an integer $n=n(k)$ such that for any $k$-coloring of $\{1,...,n\},$ the equation $xy=z$ has a monochromatic solution?

1

There are 1 best solutions below

0
On

Some hints :

This is a simple modification of Schur's theorem via an exponential.

This document from EPFL on page 35 contains a proof of Schur's theorem which you can adapt to your problem.