Erdős Problem 1055: Erdos Limit
A prime is in class if the only prime divisors of are or . In general, a prime is in class if every prime factor of is in some class , with equality for at least one prime factor. If is the least prime in c...
Mathematical statement
A prime is in class if the only prime divisors of are or . In general, a prime is in class if every prime factor of is in some class , with equality for at least one prime factor. If is the least prime in class , then how does behave? Erdos conjectured that this tends to infinity.
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_1055.variants.erdos_limit
theorem erdos_1055.variants.erdos_limit : Filter.atTop.Tendsto (fun r ↦ (p r : ℝ) ^ (1 / r : ℝ)) Filter.atTop := 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