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.
110 of 1,221 problems match
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
Asks for the growth, for almost every , of , where and is a lacunary integer sequence.
Asks whether, for some absolute and every lacunary , each whose Fourier partial sums satisfy has averages of tending to for almost all .
Asks to estimate , the fewest edges beyond that an -vertex graph needs to have cycles of every length from to . It is known that , Bondy claimed an upper bound of plus an iterated logarithm, and a 2026 proof claim is pending.
Asks to estimate , the largest degree sum forced on some triangle in a graph on vertices with more than edges, and whether , about . A reviewed rational butterfly construction refutes that proposed constant and gives for ; the optimum remains undetermined.
Asks for the infimum and supremum of the measure of over non-constant monic real polynomials with all roots in .
Asks how , the radius of the largest disc inside , behaves for monic of degree with all roots in the closed unit disc, and whether always holds.
Asks whether the least area of , over monic with roots in a closed infinite , is determined by the transfinite diameter of , and whether when that diameter is .
Asks whether every monic polynomial with all roots in the open unit disc has a path of length less than inside joining two of its roots.
Asks whether , or whether this holds only for almost all and , where is the least such that is the sum of the smallest divisors of for some .
Asks whether infinitely many primes have composite for every with .
Asks whether the number of solutions of with is for some constant . Li's preprint of June 2026 claims it exceeds for every fixed , and the claim is pending.
Asks for estimates of the largest such that any points in the plane include points with no two at distance , and whether .
Asks whether each has some such that, for every and large , every -uniform hypergraph on vertices with at least edges has subgraphs on vertices with at least edges.
Asks to estimate the least number of distinct distances determined by points in for , and whether .
Asks, for coprime with , about the density of integers that are not sums of numbers , none dividing another, and whether infinitely many coprime such integers exist.
Asks whether is possible, and whether is, where counts the points of at which a non-monomial entire function attains its maximum modulus.
Asks whether an additive function with only for a density-zero set of must be for some real .
Asks whether each has an such that, for large and any , some give whenever and for at least values of .
Asks whether the sequence of integers with at most two prime factors has .
Asks whether a random completely multiplicative function with values almost surely has .
Asks for a proof that, with Chebyshev nodes, every closed is the set of limit points of for some continuous , where is the Lagrange interpolation polynomial of degree .
Asks whether, for any array of distinct nodes in and any , some continuous makes every sequence of interpolants of with fail to converge to for almost all .
Asks whether, almost surely, the number of sites that are favorite at some time up to in a planar simple random walk is at most for all large .
Asks whether three assertions hold about the families of -uniform hypergraphs of chromatic number that avoid a fixed finite -uniform hypergraph .
Asks to estimate the largest edge counts of connected graphs on vertices with . A 1996 preprint claims a linear threshold for all such graphs, a negative answer to the closing question.