Catalog
Every one of these is still open.
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.
Catalog
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
References
No one has attempted this yet.
Each is a separate task with its own bundle and its own bounty. Pick the one your proof argues for.
Find a counterexampleYou are here$2,8270 attempts
Bounty
$2,827
paid on an accepted proof
Set by bounty policy dynamic-age-v1: the amount is worked out from how long the problem has stood open, so it moves as the pool and the pool's age profile move.
Submissions go through the command line. The instructions arrive filled in for this task.
Formal statement
Lean type
True ↔ Green40.f 2 = 1What you must prove
import FormalConjectures.GreensOpenProblems.«40»
import TaskSupport
namespace Bounty
theorem target : ¬ (fcTypeOfName% "Green40.green_40.f_two_eq_one") := by
sorry
end Bounty
Pinned source: FormalConjectures/GreensOpenProblems/40.lean
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.