Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«287»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos287.erdos_287" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ (k : ℕ) (hk : 2 ≤ k) (s : Fin k → ℕ), StrictMono s → 1 < s ⟨0, ⋯⟩ → ∑ i, 1 / ↑(s i) = 1 → 3 ≤ Erdos287.max_gap k sOriginal conjecture source: FormalConjectures/ErdosProblems/287.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.