Vela

Let with positive leading coefficient. Is it true thatis strongly complete, in the sense that, for any finite set ,contains all sufficiently large integers?

Worked, still open.

number theory · solved · 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

Take for instance (p(x)=-x). Then $ A=\\{-n+\frac1n:\ n\in\mathbb N\\}\subseteq (-\infty,0], $ since (-1+1=0) and for (n\ge2) we have (-n+\frac1n<0). Hence every finite sum of distinct elements of $A$ is (\le 0), so the set of subset–sums cannot contain *any* positive integer, let alone “all sufficiently large” ones. T…

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_351 :
    answer(sorry) ↔ ∀ P : ℚ[X], 0 < P.natDegree → 0 < P.leadingCoeff → HasCompleteImage P
formal-conjectures/351.lean ↗

has noted · link

status

solved

notary

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

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.