Erdős Problems
An open record of the Erdős problems. Discuss approaches and submit proofs here, or build on the open repository.
Open problem 0010Number theoryWork on this problemOpen problem 0197Arithmetic progressionsWork on this problemOpen problem 0200PrimesWork on this problemOpen problem 0156Sidon setsWork on this problem
Is there some such that every large integer is the sum of a prime and at most powers of 2?
Can be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?
Does the longest arithmetic progression of primes in have length ?
Does there exist a maximal Sidon set of size ?