加入
Rado's boundedness conjecture
Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.
Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.