Convex and discrete geometry
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«107»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos107.erdos_107" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ n ≥ 3, Erdos107.f n = 2 ^ (n - 2) + 1Original conjecture source: FormalConjectures/ErdosProblems/107.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.