The Erdős Compendium
A guide to 1,221 mathematical questions associated with Paul Erdős. Explore the problems, see what mathematicians have discovered, and find out which questions remain unanswered.
A collection of mathematical questions
Paul Erdős was one of the most prolific mathematicians of the twentieth century. His questions often begin with something easy to describe — a collection of numbers, a pattern, or a way of arranging objects — and lead to unexpectedly difficult mathematics.
This compendium brings those questions together in one place. You can look up a particular problem by number, read about what is known, and follow references to the original research. Some problems have been solved or disproved. Others are still open.
651 reviewed articles about 1,221 listed problems
Another 170 articles have been written but are not yet reviewed. For 400 other problems, a catalogue entry is available but a full explanation has not yet been written. These numbers are updated whenever the website is published, using the reviewed-article records and the manuscripts. They count articles, not mathematical problems solved.
A reviewed article means that its explanation and references have undergone editorial checks. It does not mean that Grand Challenge Labs has independently proved the mathematical result, or that an open problem has been solved.
Three problems worth exploring
Can repeating patterns made from odd numbers cover every integer?
Erdős problem 7 asks whether it is possible to cover all integers with a finite collection of repeating patterns whose periods are different odd numbers greater than one. The question is still open. The article starts with a small example showing how a seemingly promising arrangement leaves some integers uncovered.
How evenly can we arrange pairs of objects into groups?
In problem 665, every pair of objects must belong to exactly one group. Can the groups always be made nearly the same size, even as the total number of objects grows? The article illustrates the question with a seven-point arrangement and explains why examples that work at particular sizes do not settle the general problem.
How much must overlapping groups have in common?
Problem 836 concerns collections of groups that all overlap one another. One proposed limit on the size of such collections has been disproved; a different question about how much two groups must overlap remains open. The article separates these two questions and explains the difference.
Other places to begin
Erdős problem 1 concerns sets of numbers whose different selections always give different sums. Its original conjecture was disproved in work reported in 2026. Problem 2 asks how large the periods in a system of repeating patterns can be. Problem 3 connects sums of reciprocals with long arithmetic progressions and remains open.
These articles also illustrate an important distinction: reporting an established result, explaining an unsolved question, and independently checking a complete proof are not the same thing.
What you will find in an article
A developed explanation begins by stating the question in ordinary language and offering an example where possible. It then describes the results known so far, names the researchers or sources behind them, and identifies what remains unresolved. Links to research papers and records of GCL's work are provided for readers who want to examine the evidence in greater detail.
Not every problem has a completed explanatory article yet. Some have articles awaiting review; others currently have a shorter catalogue entry with links to their sources. They remain available to browse without being presented as finished research.
How current is the information?
The numbered catalogue is based on a recorded version of the Erdős Problems collection. That gives the entries a consistent source, but it also means a status shown in a catalogue entry may reflect an earlier point in time. A problem marked open or solved should therefore be checked against the maintained Erdős Problems website and the original research if the latest status matters.
The catalogue records and article review records are available for inspection. You can also read how articles are prepared.
The aim is to make difficult mathematics easier to approach without claiming more than the available evidence supports.