Problems
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
618 of 1,221 problems match
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
Asks whether a set of integers in whose subset sums are all distinct forces .
Asks whether a finite covering system with distinct moduli can have arbitrarily large minimum modulus. Hough proved an absolute bound.
Asks whether every set with must contain arbitrarily long arithmetic progressions.
Asks whether, for every , infinitely many have , where is the th prime.
Asks whether there are infinitely many for which three consecutive prime gaps are strictly increasing, that is, with .
Asks whether every finite coloring of the integers admits a covering system whose moduli all receive the same color.
Asks whether a subset of with no element dividing the sum of two larger elements has size at most . Bedert proved it in 2023 and showed that is the exact bound for large .
Asks whether, for every , the integers up to lacking a unique representation as a sum of two elements of number , and whether they can number . The answers are yes and no, by two Lean proofs the bounty site Conjectures.io accepted.
Asks whether the odd integers not of the form , a power of plus a prime, are the union of an infinite arithmetic progression and a set of density .
Asks whether the smallest intersecting family of -element sets in which every set of size at most misses some member has size linear in .
Asks whether, for each and large , some -free graph on vertices with at least edges has independence number at most .
Asks whether every triangle-free graph on vertices contains at most copies of .
Asks whether every infinite set has a shift such that almost all integers have a divisor of the form with .
Asks whether there is a constant such that for every and some -almost covering system has distinct moduli all in .
Asks whether there is an explicit set with whose number of representations is for every .
Asks whether every infinite set has a set of density such that contains all but finitely many integers.
Asks whether every permutation of has only distinct sums of consecutive terms. False: Hegyvári's 1986 construction and Konieczny's explicit permutation with at least such sums refute it, and the maximum lies between and .
Asks whether adding an additive basis of order to a set of Schnirelmann density raises the density by at least .
Asks whether a lacunary set can be an essential component, meaning that for every with , where is Schnirelmann density.
Asks whether a set that is not an additive basis can, for every set of Schnirelmann density and every , supply a shift such that has at least elements up to , with ; proved in 2026.
Asks whether, for large in terms of , every Sidon set has a Sidon set of size with .
Asks whether two Sidon sets in whose difference sets meet only at together have at most as many pairs as a largest Sidon set plus a constant, and a constant fraction fewer when they have equal size.
Asks whether, for each , some integer is such that every -coloring of its divisors strictly between and has a monochromatic subset whose reciprocals sum to .
Asks whether every finite coloring of the integers has a monochromatic set of distinct integers with .
Asks whether, for fixed and large , every with has a subset whose reciprocals sum to .