Source labels openChecked July 26, 2026

Erdős Problem 371

Let $P(n)$ denote the largest prime factor of $n$ . Show that the set of $n$ with $P(n+1) > P(n)$ has density $\frac{1}{2}$ .

Number theory AMS 11

Mathematical statement

Let $P(n)$ denote the largest prime factor of $n$ . Show that the set of $n$ with $P(n+1) > P(n)$ has density $\frac{1}{2}$ .

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_371

Canonical source

Complete statement target, proof intentionally absentLean 4

theorem erdos_371 :    { n | Nat.maxPrimeFac (n + 1) > Nat.maxPrimeFac n }.HasDensity (1/2) := 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/371background