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 in which dimensions an infinite walk in with positive unit-vector steps must contain a three-term arithmetic progression.
Asks whether every infinite walk in with steps from a finite set must contain three collinear points.
Asks whether, for , every ordering of the real numbers contains an increasing or decreasing -term arithmetic progression.
Asks whether every permutation of the positive integers contains a monotone four-term arithmetic progression. A Lean-checked construction, certified by the bounty site Conjectures.io in September 2026, gives a permutation with none.
Asks whether the complement of a set of integers with all pairwise sums distinct must contain an infinite arithmetic progression.
Asks whether the complement of a set of reals with no three-term arithmetic progression must contain an infinite arithmetic progression.
Asks how many congruence classes with distinct moduli at most can be chosen so that no integer lies in two of them.
Asks whether some has a covering system whose moduli are the divisors of above , with two classes meeting only when their moduli are coprime.
Asks whether every large integer can be written as with , where counts prime factors with multiplicity.
Asks whether, for almost every , the best underapproximations of by sums of distinct unit fractions are eventually built greedily.
Asks whether, for every , large Steiner triple systems exist in which any edges span at least vertices for .
Asks whether non-parallel lines in the plane, no four through one point, must form a Gallai triangle: three of the lines whose three intersection points each lie on only two lines.
Asks whether the least number of lines through exactly two of points in the plane, not all collinear, tends to infinity, and how fast.
Asks whether points in the plane, at most on any line, always determine lines through at least two of them.
Asks whether the complement of any set in the plane with no two points at distance must contain the four corners of a unit square.
Asks whether some set has the property that every translated and rotated copy of it contains exactly one point of .
Asks whether, for each , enough points in general position in the plane always contain an empty convex -gon, and how many are needed.
Asks whether the primes contain arithmetic progressions of every finite length.
Asks whether the sum of the squared gaps between consecutive integers below that are coprime to is .
Asks whether some set with elements up to makes every large integer of the form with .
Asks for estimates of the largest number of pairs at distance among points of diameter in .
Asks whether any points in must include three that determine an obtuse angle.
Asks whether a trigonometric polynomial with all roots real and maximum modulus satisfies .
Asks whether some non-linear entire function has rational exactly when the real number is rational.
Asks whether, for a non-polynomial entire function , the limit as of , when it exists, must be .