Unclaimed brand
Every Erdős problem, with its sources, its results and the evidence behind them.
Liking this brand profile? Share this page
Hex Code
Color name
RGB
HSL
CMYK
#6FBC81
De York
111, 188, 129
134, 36, 59
41, 0, 31, 26
#0F1012
Woodsmoke
15, 16, 18
220, 9, 6
17, 11, 0, 93
#EAEAEA
Mercury
234, 234, 234
0, 0, 92
0, 0, 0, 8
Erdős Problems is an open, community-driven repository devoted to documenting and advancing the mathematical problems associated with Paul Erdős. Its Problems Wiki provides a browsable, searchable record of questions, sources, results, and supporting evidence. Visitors can explore problems by topic, review their current status, and contribute by discussing approaches, submitting proofs, or building on existing work.
The site presents a broad range of mathematical challenges, including questions in number theory and combinatorics. Examples include whether every sufficiently large odd integer can be expressed as the sum of a squarefree number and a power of two, whether a distinct covering system can have only odd moduli, and questions about the size of maximal Sidon sets. Each listing identifies the problem and offers a way to work on it, supporting collaboration between researchers and other interested readers.
The repository tracks problems as open, claimed, or solved, giving users a snapshot of progress across the collection.
Brand industry
Science and Education
Company type
Suggest company type
Year founded
Suggest founded year
Company size
Suggest company size