Back to Problems

erdos_416.variants.Pillai

Specification

Let `V(x)` count the number of `n≤x` such that `ϕ(m)=n` is solvable. Pillai proved `V(x)=o(x)`. Ref: S. Sivasankaranarayana Pillai, _On some functions connected with $\phi(n)$_

Actions

Submit a Proof

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

Submit Proof
Lean 4 Statement 
theorem erdos_416.variants.Pillai : V =o[atTop] id
ID: ErdosProblems__416__erdos_416.variants.Pillai
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.