All open problems
Source labels openChecked July 26, 2026

WikipediaNumber theory

Pollock's (tetrahedral numbers) conjecture: Salzer Levine

Salzer–Levine strengthening (as stated on Wikipedia/OEIS): there are exactly 241241 integers that are not a sum of 44 tetrahedral numbers, and the largest is 343867343867.

Mathematical statement

Salzer–Levine strengthening (as stated on Wikipedia/OEIS): there are exactly 241241 integers that are not a sum of 44 tetrahedral numbers, and the largest is 343867343867.

Statement source: Wikipedia statement material

Statement terms: CC-BY-SA-4.0

Attributed source material. Reuse must follow the linked attribution and share-alike terms.

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

pollock_tetrahedral.salzer_levine

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem pollock_tetrahedral.salzer_levine :    IsGreatest NotSumOfFourTetrahedral 343867 := 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