Vela

For what values of is the sequence complete (that is, all sufficiently large integers are the sum of distinct integers of the form )?

Worked, still open.

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

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Let [ a_n=\big\lfloor t,\alpha^n\big\rfloor\qquad (n=1,2,3,\dots) ] and let (\Sigma) be the set of all **finite sums of distinct terms** (a_{n_1}+\cdots+a_{n_k}) (distinct indices). The sequence is **complete** if every sufficiently large integer lies in (\Sigma).

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

candidate solution ↗

formal

AMS 11 · open (literature)

theorem erdos_349 :
    {(t, α) | 0 < t ∧ 0 < α ∧ IsGoodPair t α} = answer(sorry)
formal-conjectures/349.lean ↗

status

open

notary

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

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.