Number theory
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«1056»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos1056.erdos_1056" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ k ≥ 2,
∃ p, ∃ (_ : Nat.Prime p), ∃ boundaries, ∃ (_ : StrictMono boundaries), Erdos1056.AllModProdEqualsOne p boundariesOriginal conjecture source: FormalConjectures/ErdosProblems/1056.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.