Date(s) - 22/11/2016
11 h 00 min - 12 h 00 min
In this talk we describe some progress on the following problem of A. Sárközy. For any integer K≥1, let s(K) be the smallest integer such that when the set of squares is coloured using K colours, every sufficiently large integer can be written as a sum of at most s(K) squares of the same colour. Also, let t(K) be the corresponding integer in the analogous context for the set of primes. The problem is to find optimal upper bounds for s(K) and t(K) in terms of K.