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.
Combinatorics
Date added
Erdős problem 241 - generalization
More generally, Bose and Chowla [BoCh62] conjectured that the maximum size of
A⊆{1,…,N} with all r-fold sums distinct (aside from the trivial coincidences)
then ∣A∣∼N1/r.
$2,715 bounty·nobody has started
week of 18 Sept 2025 · nothing publishedweek of 25 Sept 2025 · nothing publishedweek of 2 Oct 2025 · nothing publishedweek of 9 Oct 2025 · nothing publishedweek of 16 Oct 2025 · nothing publishedweek of 23 Oct 2025 · nothing published
Solve it
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
[BoCh62] Bose, R. C. and Chowla, S., Theorems in the additive theory of numbers. Comment. Math. Helv. (1962/63), 141-147.
[Gr01] Green, Ben, The number of squares and {Bh[g]} sets. Acta Arith. (2001), 365-390.
[Gu04] Guy, Richard K., Unsolved problems in number theory. (2004), xviii+437.
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.