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, for all large , some degree- polynomial with coefficients has on , with constants independent of and ; yes for every , by Balister et al. (2020).
Asks whether, for any sets of complex numbers with no finite limit point, some transcendental entire function has, for each , a derivative vanishing on all of .
Asks whether every string of length over letters (erdosproblems.com prints , Erdős's misprint) contains two adjacent blocks that are permutations of each other. Keränen's word on four letters disproves it.
Asks for estimates of the largest upper density of a measurable set in the plane with no two points at distance , and whether .
Asks whether the distribution of normalized gaps between the integers coprime to the product of the first primes tends to a continuous limiting function.
Asks whether every set with for all large gives , where counts the solutions of with prime and .
Asks whether there is an infinite set of primes such that the gaps between consecutive integers divisible only by primes in tend to infinity.
Asks whether, for coprime , every large integer is a sum of distinct numbers with .
Asks whether there are infinitely many with for all , where counts distinct prime factors.
Asks whether is irrational, where is the sum-of-divisors function.
Asks whether is irrational for every , where . A 2026 kernel-checked Lean proof, rebuilt, replayed and statement-audited here, answers yes.
Asks whether a sequence with , whose sums of distinct terms meet every arithmetic progression infinitely often, must represent every large integer as such a sum.
Asks whether a set with and for every , where is the distance to the nearest integer, represents every large integer as a sum of distinct elements.
Asks whether every infinite sequence in has a subinterval whose discrepancy is unbounded as .
Asks whether is irrational for every sequence of positive integers , where is the number of divisors of .
Asks how slowly an increasing integer sequence can grow if is irrational for every sequence of positive integers .
Asks whether every sequence of positive integers with convergent has an integer making irrational.
Asks whether a system of congruences that covers consecutive integers must cover every integer.