Back to Problems

erdos_416.variants.Erdos

Specification

Let `V(x)` count the number of `n≤x` such that `ϕ(m)=n` is solvable. Erdős proved V(x)=x(logx)^(−1+o(1)). Ref: Erdős, P., _On the normal number of prime factors of $p-1$ and some related problems concerning Euler's $\varphi$-function._

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_416.variants.Erdos : ∃ f : ℝ → ℝ, f =o[atTop] (1 : ℝ → ℝ) ∧
    ∀ᶠ x in Filter.atTop, V x = x * x.log ^ (-1 + f x)
ID: ErdosProblems__416__erdos_416.variants.Erdos
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.