Combinatorics
WithdrawnWithdrawn 30 Sept 2026
WITHDRAWN (removed from the open catalog at Ben Green’s request; prior solved entries and results remain available)
Formal statement
Proof target
import FormalConjectures.GreensOpenProblems.«36»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Green36.green_36.variants.cks05" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ ε > 0,
∃ᶠ (n : ℕ) in Filter.atTop,
∃ H x,
∃ (_ : Finite H),
∃ A B,
↑n ^ (2 - ε) ≤ ↑(Nat.card H) ∧
↑(Nat.card H) ≤ ↑n ^ (2 + ε) ∧
(∀ (i : Fin n), ↑n ^ (2 - ε) ≤ ↑(A i).card * ↑(B i).card) ∧ Green36.SimultaneousDoubleProduct A BOriginal conjecture source: FormalConjectures/GreensOpenProblems/36.lean
References
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.