Back to Problems

erdos_946.variants.heathbrown_lower_bound

Specification

The number of $n \le x$ with $τ(n) = τ(n+1)$ is at least $x / (\log x)^7$ for all sufficiently large $x$. Proved in [He84].

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_946.variants.heathbrown_lower_bound :
    (fun x => x / (x.log)^7) =O[atTop] erdos946Count
ID: ErdosProblems__946__erdos_946.variants.heathbrown_lower_bound
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.