Source labels openChecked July 26, 2026

Erdős Problem 950: Sum Primes

The study of $f(p)$ is even harder, and Erdős could not prove that $\sum_{p<x}f(p)^2\sim \pi(x)$ .

Number theory AMS 11

Mathematical statement

The study of $f(p)$ is even harder, and Erdős could not prove that $\sum_{p<x}f(p)^2\sim \pi(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_950.variants.sum_primes

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_950.variants.sum_primes :    answer(sorry) ↔      (fun x : ℕ ↦ ∑ p ∈ (Finset.range x).filter Prime, (f p) ^ 2) ~[atTop]        fun x ↦ (π x : ℝ) := 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

Pinned Formal Conjectures sourceformalization erdosproblems.com/855background erdosproblems.com/950background mathoverflow/508491background