Definition
A famous open math problem posed by Paul Erdős, often easy to state but very hard to prove.
A problem from Paul Erdős's published lists of open conjectures, frequently in combinatorics or number theory; used as a benchmark for AI-driven formal proof search systems.
Also called: Erdős problems