Every problem here was open when it entered the pool.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Erdős problem 357 - monotone, part i · Conjectures.io
Number theory
Erdős problem 357 - monotone, part i
Let h(n) be the maximal k such that there exist integers 1≤a1≤…≤ak≤n
such that all sums of the shape ∑u≤i≤vai are distinct. Is h(n)=o(n)?
0 α bounty·1 piece from 1 person·last one 29 days ago
week of 11 Oct 2025 · nothing publishedweek of 18 Oct 2025 · nothing publishedweek of 25 Oct 2025 · nothing publishedweek of 1 Nov 2025 · nothing publishedweek of 8 Nov 2025 · nothing publishedweek of 15 Nov 2025 · nothing published
Solve it
A complete proof or refutation in Lean. The first one the validator accepts takes the whole bounty.
11 Oct 2025a year of work on this problem3 Oct 2026
erdosproblems.com/357
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.