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 for the minimum growth rate of a non-constant entire for which has finite measure, and whether some must then also give finite measure.
Asks whether a family of entire functions taking at most distinct values at each point has cardinality at most , for .
Asks whether circles in the plane can always be covered by one circle whose radius is the sum of their radii, provided no line missing all of them splits them into two nonempty groups.
Asks for a proof that the Boolean algebra of sets of integers modulo sets of density is not isomorphic to the Boolean algebra of sets modulo sets of logarithmic density .
Asks whether a square and a circle of the same area can be cut into finitely many congruent pieces.
Asks whether a function with for almost all must agree almost everywhere with some satisfying for all .
Asks whether splits into countably many sets in each of which all pairwise distances are distinct.
Asks whether every -coloring of , for sets of size , has a monochromatic product of three countably infinite subsets.
Asks which nodes minimize , where the are the fundamental Lagrange interpolation polynomials.
For nodes , let be the least, over the intervals between consecutive points of , of the maximum of on the interval. Asks whether and which nodes maximize .
Asks whether the smallest set containing and closed under , and has positive lower density.
Asks whether some with lower density above has no two members, possibly equal, whose sum is a power of two.
Asks whether infinitely many have prime for every coprime to with .
Asks whether, for irrational , the set of such that lies within of an integer is an additive basis of order .
States that for every non-integer real the integers with have density .
Asks whether some constant makes every polynomial of large degree with coefficients have ; answered no by the OpenAI release's construction of 2026-09-23.
Asks whether, for fixed , the sum of the fundamental Lagrange polynomials for nodes in satisfies .
Asks for the typical structure of the graph left by removing uniformly random triangles from until none remain, and whether its edge count has order . The sharp constant is formally verified, but the typical structure is open.
Asks for which the number of permutations in of order exactly is largest.
Asks whether in probability, where is the radius of the largest origin-centered disc a planar simple random walk covers within steps. erdosproblems.com's "almost every" wording is corrected, and the result is proved by Révész and by Dembo–Peres–Rosen–Zeitouni.
Asks, for each integer , for the probability that a planar simple random walk has exactly sites tied for the maximum local time infinitely often.