Vela

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_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

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 A
formal-conjectures/26.lean ↗

Kernel-checked proof; human-attested statement.

  • variant reviewer:will-blair erdos_26.variants.tenenbaum.lean

status

solved

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 e6371a4a9b8a24cd7104d886993757e78308f2d1daeb4cfcc5c2f7226f03cccf

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.