erdős #26
Let be infinite. Must there exist some such that almost all integers have a divisor of the form for some ?
Worked, still open.
number theory · solved · formalized (Lean) · 0 attempts
machinery: Behrend-sequence,set-of-multiples,density-of-multiples,divisor-in-prescribed-set,covering-system,CRT-construction,Davenport-Erdos,unit-fractions,prime-distribution
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
alphaproof · AlphaProof Nexus (DeepMind) · machine-verified (Lean)
Machine-verified Lean proof (kernel-checkable, sorry-free).
Lean proof ↗formal
AMS 11 · test (literature)
theorem not_isThick_of_finite {ι : Type*} [Finite ι] (A : ι → ℕ) : ¬IsThick Aformal-conjectures/26.lean ↗Kernel-checked proof; human-attested statement.
- variant — reviewer:will-blair
erdos_26.variants.tenenbaum.lean
status
solved