Vela

Let be an infinite sequence of integers such that . If every infinite arithmetic progression contains infinitely many integers which are the sum of distinct then every sufficiently large integer is the sum of distinct .

Worked, still open.

number theory · solved · formalized (Lean) · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

formal

AMS 11 · solved (literature)

theorem erdos_253 : ¬ ∀ a : ℕ → ℕ, 0 < a 0 →
    RepresentsAPs a → (Filter.atTop.Tendsto (fun n ↦ (a <| n + 1 : ℝ) / a n) (𝓝 1)) →
      subsetSums (Set.range a) ∈ Filter.cofinite
formal-conjectures/253.lean ↗

status

solved

notary

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

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.