All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 889: General

Let vl(n)=maxklv(n,k)v_l(n) = \max_{k\geq l} v(n,k). For every fixed ll, vl(n)v_l(n) \to \infty as nn \to \infty

Mathematical statement

Let vl(n)=maxklv(n,k)v_l(n) = \max_{k\geq l} v(n,k). For every fixed ll, vl(n)v_l(n) \to \infty as nn \to \infty

[ErSe67] Erdős, P. and Selfridge, J. L., Some problems on the prime factors of consecutive integers. Illinois J. Math. (1967), 428--430.

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_889.variants.general

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_889.variants.general :     l, Tendsto (v_l l) 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