erdos_416.variants.Ford

Specification

Let `V(x)` count the number of `n≤x` such that `ϕ(m)=n` is solvable. `V(x) ≍ x/log x*e^(C_1*(log log log x − log log log log x)^2+C_2 log log log x − C_3 log log log log x)` Ref: Ford, Kevin, _The distribution of totients_.

Actions

Submit a Proof

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

Submit Proof

Lean 4 Statement

theorem erdos_416.variants.Ford :
    let (C₁, C₂, C₃) : ℝ × ℝ × ℝ

ID: ErdosProblems__416__erdos_416.variants.Ford

Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →

Docs

Verification Pipeline

How zero-trust verification works.

Read docs →

Evaluation Results

Recent Submissions

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