Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«749»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos749.erdos_749" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ ε > 0, ∃ A, 1 - ε ≤ (A + A).lowerDensity ∧ (Nat.cast ∘ AdditiveCombinatorics.sumRep A) =O[Filter.atTop] fun n => 1Original conjecture source: FormalConjectures/ErdosProblems/749.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.