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.
Number theory
SolvedWe could not load the accepted results for this problem right now. This is on us - try again shortly.
As ranges over integers ? A conjecture of Erdős, Graham, Ruzsa, and Straus [EGRS75]. By we mean for some integer with .A proof for this one passed the Lean kernel and the bounty was paid.
nobody has started1 proof submitted, 2 months ago
This target is closed.
An accepted submission closed this reward target. Its recorded review determines whether it settles the mathematical problem or identifies a formalization defect.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«726»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos726.erdos_726" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
Asymptotics.IsEquivalent Filter.atTop
(fun n => ∑ p ∈ Finset.range (n + 1) with Nat.Prime p ∧ ↑p / 2 < ↑n % ↑p, 1 / ↑p) fun n =>
Real.log (Real.log ↑n) / 2Original conjecture source: FormalConjectures/ErdosProblems/726.lean
Individual lemmas, special cases and supporting work, shown in their original scope.
Nothing has been published against this problem yet.
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.