Vela

Let . Is there some such that the density of integers of the form , where and has at most prime divisors, is at least ?

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

In fact it is explicitly listed as **Erdős Problem #851**: whether for every (\epsilon>0) there is a bounded (r=r(\epsilon)) so that the set [ {,2^k+n:\ k\ge 0,\ n\ \text{has at most }r\text{ prime divisors},} ] has (natural) density at least (1-\epsilon). ([Erdős Problems][1])

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

formal

AMS 11 · solved (literature)

theorem erdos_851.variants.romanoff : 0 < Set.lowerDensity (TwoPowAddSet 1)
formal-conjectures/851.lean ↗

solved · link

status

solved

notary

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

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.