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 for the size of the largest whose subsets all have distinct sums of reciprocals.
Asks whether a set in which each is a sum of two distinct elements at most times splits into boundedly many parts in which each is such a sum fewer than times. Nešetřil and Rödl answer no, and erdosproblems.com's count of ordered pairs makes trivial.
Asks whether some minimal basis of positive density has, for each element , a positive upper density of integers that cannot be represented without .
Asks whether two sets of integers whose counting functions are both must share infinitely many equal nonzero differences.
Asks whether every set of density zero lies in for some set with .
Asks whether every additive basis of density zero has .
Asks whether the integers that are sums of exactly distinct elements of a basis of order must have positive lower density.
Asks whether the sequence that extends a finite set by repeatedly adding the least larger integer that is not a sum of two earlier terms has eventually periodic differences.
Asks, after Folkman, whether there is an absolute constant such that every multiset of integers with counting function at least has subset sums containing an infinite arithmetic progression. Szemerédi and Vu proved this, and Folkman's question for every constant is open.
Asks whether, for a sufficiently large constant , every set of integers with at least elements up to , for every , has subset sums containing an infinite arithmetic progression.
Asks whether a sequence that stays complete after any finite deletion but never after an infinite one, with for some , must have .
Asks whether some integer sequence with has subset sums of density even after any finite set of terms is removed.
Asks whether a finite set of integers with all subset sums distinct must have reciprocals summing to less than .
Asks whether the numbers , for with positive leading coefficient, stay complete after any finite set is removed.
Asks whether a measurable set of infinite measure in the plane must contain the vertices of an isosceles trapezoid of area , or of other prescribed shapes.
Asks whether some sequence of positive integers with for a fixed has finite sums of reciprocals covering every rational in some open interval.
Asks whether there is such that, for all large , some integers have at least distinct sums of consecutive terms.
Asks whether some infinite sequence of integers writes every large as a sum of consecutive terms at least twice, or in a number of ways .
Asks how fast grows, the least number of classes into which can be partitioned so that is never a sum of distinct members of one class.
Asks whether subsets of a set of naturals have sum , and if their size is fixed too. Sárközy and Szemerédi proved the first (Stanley found the exact maximizers), and Halász the second, via a bound on signed sums of -separated plane vectors in a unit ball.
Asks whether only finitely many collections of disjoint integer intervals, each containing at least four integers, have the product of all their members equal to a square.
Asks whether every large has consecutive -smooth integers up to . As worded it is trivially true, and it is proved in both nontrivial readings: each member is -smooth, or the run lies in .
Asks whether infinitely many have the largest prime factor of below and that of below .
Asks whether the integers whose largest prime factor is smaller than that of have density .