Number theory
WithdrawnWithdrawn 8 Sept 2026
RETIRE_SETTLED (The September 2026 proof gives f(n) ≫ sqrt(n), which implies f(n)/log(n) tends to infinity. The tracker records PROVED (LEAN). This settles the main target only; the separate isLittleO upper bound remains.)
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«126»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos126.erdos_126" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ (f : ℕ → ℕ),
Erdos126.IsMaximalAddFactorsCard f → Filter.Tendsto (fun n => ↑(f n) / Real.log ↑n) Filter.atTop Filter.atTopOriginal conjecture source: FormalConjectures/ErdosProblems/126.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.