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 under which set-theoretic assumptions the plane has a three-coloring in which every uncountable set contains a pair of points of each color.
Asks whether, for , the set of sums with in has size at least (the Erdős–Heilbronn conjecture); proved in 1994.
Asks whether there are a polynomial of degree at least and a set such that every integer is in exactly one way, with and a value of .
Asks whether every sequence in satisfies ; proved by Chung and Graham with the sharp constant .
Asks whether, when , iterating the maps from must produce some with repeated elements; yes, by Klarner's 1982 theorem, its 2022 extension and a 2025 thread proof.
Asks for analogs, for and other algebraic numbers, of the Graham–Pollak recurrence , whose differences are the binary digits of ; solved by Stoll's families for every positive real and every base.
Asks whether there is an absolute constant such that, for large in terms of , every -coloring of leaves at least of these integers expressible as a sum of two distinct integers of one color.
Asks whether the least number of terms in , over with exactly nonzero terms, tends to infinity as .
Asks whether every set of integers of positive density contains three distinct members with the least common multiple of and ; true by Kleitman's union-free theorem, attested here second-hand.
Asks whether with all products distinct must satisfy ; proved by Szemerédi (1976), with a second proof by Erdős and Szemerédi.
Asks whether an additive function whose consecutive differences stay bounded must equal for some constant .
Asks whether, for real with , the positions of in the gaps are uniformly distributed for almost every ; LeVeque's question, disproved by Schmidt. The erdosproblems.com wording takes integer , where the Davenport–Erdős theorem gives yes.
Asks whether some makes every large enough integer of the form with all .
Asks whether, for , the multiset of sums of distinct elements of a finite set , together with , determines when is large enough in terms of .
Asks whether, for every irrational and , some positive integers satisfy . The erdosproblems.com wording, over every irrational , fails for negative .
Asks for the number of antichains of subsets of an -element set, that is, families in which no member contains another.
Asks whether at most of the signed sums of complex numbers with can lie in one open disc of radius .
Asks whether every doubly stochastic matrix has a permutation along which the product of the entries is at least .
Asks whether, if each real is assigned a bounded set of outer measure , some infinite has for all distinct (independent of ZFC), and whether closed of measure give such an of size (proved).
Asks for estimates of the largest size of a set in with only two distinct pairwise distances. It is settled to leading order: .
Asks for the largest angle such that every set of points in the plane has three points determining an angle of at least .
Asks whether every set of diameter in is the union of at most sets of smaller diameter.
Asks whether, for each , the set where a monic polynomial has modulus below has connected components of diameter above , whatever the degree.
Asks whether the exponential sum over any set of integers has mean absolute value .
Asks whether every non-polynomial entire function has a locally rectifiable path to infinity with finite for every .