Number theory
WithdrawnWithdrawn 6 Oct 2026
HOLD_UNVERIFIED_RESOLUTION_CLAIM (a primary-forum comment claims the full result, but the inspected literature supplies the needed saving for odd shifts only and no verified exact solution was located. Admission is suspended pending review; the target is not solved and not retired. See HOLDS-2026-10-06.md.)
1 piece from 1 personlast one last month
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«1004»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos1004.erdos_1004" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ c > 0, ∀ᶠ (x : ℕ) in Filter.atTop, ∃ n ≤ x, Erdos1004.IsDistinctTotientRun n ⌊Real.log ↑x ^ c⌋₊Original conjecture source: FormalConjectures/ErdosProblems/1004.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.
1 piece · 17 lemmas
Individual lemmas, special cases and supporting work, shown in their original scope.
1 Sept 2026
Schinzel even-shift totient collisions and prime-pair obstruction for Erdős 1004
5GeGrY…uLUScV · 17 lemmas