Erdős Problem 950: Weaker Pi
Erdős writes that a 'weaker conjecture which is perhaps not quite inaccessible' is that, for every , if is sufficiently large there exists such that . Compare this to [855].
Mathematical statement
Erdős writes that a 'weaker conjecture which is perhaps not quite inaccessible' is that, for every , if is sufficiently large there exists such that . Compare this to [855].
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_950.variants.weaker_pi
theorem erdos_950.variants.weaker_pi : answer(sorry) ↔ ∀ ε > 0, ∀ᶠ x in atTop, ∃ y < x, (π x : ℝ) < (π y : ℝ) + ε * (π (x - y) : ℝ) := 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