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
Paused
Green's open problem 24 - conjecture
Conjecture p.579 in [Aa19]: (13+o(1))n2.
Pin rotation in progress; nothing can be submitted right now.
[Aa19] Aaronson, James. "Maximising the number of solutions to a linear equation in a set of integers." Bulletin of the London Mathematical Society 51.4 (2019): 577-594.
[HaL28] Hardy, G. H., and J. E. Littlewood. "Notes on the theory of series (VIII): an inequality." Journal of the London Mathematical Society 1.2 (1928): 105-110.
No one has attempted this yet.
Formal statement
Lean type
Green24.variants.gamma = 1 / 3
What you must prove
import FormalConjectures.GreensOpenProblems.«24»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Green24.variants.conjecture" := by
sorry
end Bounty
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.
Green's open problem 24 - conjecture · Conjectures.io