Vela

erdős #359 · segmented numbers

← #358 · #360 (packet.json; erdosproblems.com)

Let be an infinite sequence of integers such that and is the least integer which is not a sum of consecutive earlier s. What can be said about the density of this sequence?In particular, in the case , can one prove that and for any ?

Open — best to date is a honest null, not yet sealed.

number theory · open · formalized (Lean) · 1 attempt

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

evidence

honest null

needs verification

attempted via frontier '?' (transfer_strength=n/a) -> no_progress

No solve/partial on this pass. Transfer into the owned frontier was 'n/a'. Do not re-attack cold; needs a new idea or richer accumulated context.

unverified AI candidates (2)

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

and for each (i\ge 1), let (a_{i+1}) be the **least integer (>a_i)** that is **not** representable as a sum of **consecutive** earlier terms (a_j+\cdots+a_k) with (1\le j\le k\le i). [[nomath]](This “$>a_i$” is implicit in the “infinite increasing sequence” condition; otherwise the rule could pick something $\le a_i$.)…

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_359.parts.i (A : ℕ → ℕ) (hA : IsGoodFor A 1) :
    atTop.Tendsto (fun k ↦ (A k : ℝ) / k) atTop
formal-conjectures/359.lean ↗

oeis

status

open

notary

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

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.