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 to estimate the size of the largest monochromatic family closed under unions and intersections that every two-coloring of the subsets of must contain. The exact orders remain open. A graded examination supports the claimed superpolynomial union-family lower bound and the subexponential upper argument with its explicit Sauer–Shelah premise; catalog acceptance remains pending.
Asks whether every finite coloring of the integers has, for each , a monochromatic -term progression of primes, and a monochromatic -term progression whose common difference is prime.
Asks for an estimate of the number of minimal covering systems with distinct moduli in , where minimal means no proper subsystem still covers every integer.
Asks about sets of distinct moduli that cover the integers for some choice of residues while no proper subset can, including how many have size , the extreme values of their largest modulus, and their largest reciprocal sum.
Asks whether every two-coloring of admits an infinite set whose pairwise sums, doubles included, share one color (Owings's question). erdosproblems.com listed it as open, the analogue for three colors is false, and a proof for two colors is claimed.
Asks whether, for all , some makes the largest prime factor of exceed on a set of of lower density at least , as the erdosproblems.com curator reads the density.
Asks for estimates of , the largest such that some choice of one class for each makes every satisfy at least of the congruences. erdosproblems.com's own argument, a pending claim, gives .
Asks to estimate , the size of the largest subset with no isosceles triangle that any points in must contain, in particular whether for some .
Asks whether some path to infinity, changing one coordinate by per step, stays among coprime pairs with and a composite coordinate. Stewart quickly answered yes to Erdős's first version, without the composite condition.
Korsky claims all three mean-normalized consecutive-gap divergences. The local tier-1 completion extends his approach to repeated points; acceptance of his full claim remains pending.