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.
问题
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。
符合的问题
Primes p for which p − 2 has an odd number of prime factors
Prove that for infinitely many primes p, the number p − 2 has an odd number of prime factors counted with multiplicity.
Composite numbers in sumsets of sparse sets
Show that if A, B ⊆ {1,…,N} each have at least N^0.49 elements, then the sumset A + B contains a composite number.