All open problems
Source labels openChecked July 26, 2026
Erdős Problem 416: Ii
Let V(x) count the number of n≤x such that ϕ(m)=n is solvable. Is there an asymptotic formula for V(x)?
Mathematical statement
Let V(x) count the number of n≤x such that ϕ(m)=n is solvable.
Is there an asymptotic formula for V(x)?
Statement source: Erdős Problems statement material
Statement terms: Source-specific
Source-specific terms. Therefore does not assert reuse rights beyond attributed display.
Statement artifacts, not proofs
These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.
Pinned Lean formulation 1
erdos_416.parts.ii
Complete statement target, proof intentionally absentLean 4
theorem erdos_416.parts.ii : let f : ℝ → ℝ := answer(sorry) Filter.Tendsto (fun x => V x / f x) atTop (𝓝 1) := by sorry- Statement source
- Formal Conjectures
- Lean version
- v4.27.0
- Placeholder
- Present; no proof artifact
- Source evidence
- Pinned source index
- Fidelity review
- Community formulation
References