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 infinitely many integers have the largest prime factors of , and in strictly decreasing order.
Asks for the order of growth, for , of the number of that need exactly distinct factorials, the largest being , to form a square product.
Asks whether the integers with squarefree for at least values of have a density, and whether that density is positive. Both are answered yes by Granville and Ramaré's 1996 theorem.
Asks whether , where is the largest such that each with is divisible by for some prime . Answered yes in 2025 by Cambie, Kovač and Tao.
Asks whether the number of lying in some interval whose product has a repeated largest prime factor is asymptotic to the number of divisible by the square of their largest prime factor.
Asks whether the number of highly composite numbers up to grows faster than every fixed power of .
Asks whether, for , every other than has a prime divisor . Proved by Ecklund in 1969, while erdosproblems.com's strict bound fails at .
Asks whether there is an absolute constant such that every with has a divisor in .
Asks for bounds on , where is the largest possible in with , and in particular whether .
Asks whether, for unit complex numbers and random signs , the sum has modulus at most with probability . Erdős asked it with radius , which fails for every even .
Asks whether has only finitely many solutions with the distinct.
Asks whether has no solutions in positive integers with and .
Asks whether there is such that, for infinitely many , some with have .
Asks for a proof that every finite set of integers has two members with .
Asks whether, for each odd prime , the equation has only finitely many solutions.
Asks whether the number of solutions of in nonnegative integers is bounded by an absolute constant.
Asks whether the number of iterations of Euler's totient needed to reach 1, divided by , has a distribution function or is almost always constant.
Asks for the set of limit points of , where counts divisors.
Asks whether there is an increasing sequence of density whose products of blocks of consecutive terms are all distinct. Chojecki and Sneiderman answered yes in July 2026, in work erdosproblems.com accepts but that is not refereed.
Asks whether the integers that eventually appear, starting from and repeatedly appending every with , have positive density, read as positive lower density following the erdosproblems.com curator.
Asks whether some graph on vertices has distinct unique subgraphs, that is, subgraphs that occur in exactly one way.
Asks whether, for every and , some sum of consecutive primes is divisible by .
Asks whether every sufficiently sparse that misses a residue class modulo every prime has a shift made up only of primes; disproved by Weisenberg (2024), who built arbitrarily sparse admissible sets with no prime shift.