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 often, a block of consecutive integers has a larger least common multiple than a later block of . Cambie (2024, arXiv) proved this in a strong form, with the ratio exceeding any constant.
Asks whether, for almost all , some integer has least prime factor .
Concerns the density of the integers whose th smallest prime factor is , and asks whether it is unimodal in for each fixed .
Asks whether the density of integers with exactly one divisor in is unimodular in for ; disproved by Cambie, who also shows it has many local maxima.
Asks for an estimate of , the largest ratio of the largest to the smallest with over totient values .
Asks for estimates of and , the lengths of the longest chains of prime divisors and of divisors of in which each term is modulo the previous one, and whether for almost all .
Asks whether there is some such that, as , the density of integers with a divisor in tends to for and to for .
Asks whether, for and large in terms of , more -subsets of than those through a fixed pair force two that meet in one point. Frankl proved it, but the erdosproblems.com wording, with no range on , fails.
Asks for the largest family of subsets of in which no two members meet in exactly elements, and whether for each it is below for some when .
Asks whether some girth bound forces every finite unit distance graph in the plane to be 3-colorable.
Asks whether every finite Sidon set of integers can be extended to a perfect difference set modulo for some prime .
Asks whether every -regular graph contains a -regular subgraph, and whether some forces one in every -regular graph. Tashkinov answered both yes in 1982, for and for every .
Asks whether the largest 3-uniform hypergraph on vertices with no three edges spanning six vertices has edges, that is, fewer than any fixed fraction of for large .
Asks whether every -vertex graph has , where is the order of the largest clique subdivision in . This Erdős–Fajtlowicz conjecture was proved by Fox, Lee and Sudakov in 2013.
Asks whether there is a constant such that every graph on vertices with at least edges contains a subdivision of . This conjecture of Erdős, Hajnal and Mader was proved by Bollobás and Thomason and by Komlós and Szemerédi.
Asks whether the size Ramsey number of the path grows faster than but slower than , and whether that of the cycle is . Both are linear, so the first answer is no and the other two are yes.
Asks for bounds on , the least such that every red/blue coloring of has a red 3-term progression or a blue -term one. Green, Hunter and Schoen meet the two explicit challenges, but the order of magnitude remains open.
Asks whether a Steiner system on points with blocks of size , covering every -set exactly once, exists for all large that satisfy the divisibility conditions.
Asks whether there are infinitely many with , and . It was answered yes in 2026 by an AI-generated proof credited to Barreto, and separately by Pomerance.
Asks whether there are infinitely many with such that the denominator of has only primes . It was answered yes in 2026 by an AI-generated proof credited to Barreto and Price.
Asks whether there are infinitely many pairs such that and have the same set of prime divisors. It was answered yes in 2026, with consecutive pairs, by an AI proof credited to Price.
Asks whether, for some , at least non-decreasing sequences of block sizes arise from designs on points in which every pair of points lies in exactly one block.
Asks to prove that at most nondecreasing sequences can be the point counts of lines, each through at least two of points in the plane.