Vela

For which number theoretic functions is it true that, for any such that for almost all , there are infinitely many such that

Worked, still open.

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

Write $a(n)=n+f(n)$. Then the numerator is just the number of indices $n$ whose value $a(n)$ falls in the interval $(x,x+F(x))$. Equivalently, [ #\\{n:\ a(n)\in(x,x+F(x))\\}=\sum_{y=x+1}^{x+F(x)-1} m(y), ] where $m(y)=#\\{n:\ a(n)=y\\}$ is the “multiplicity” of the value $y$.

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

status

open

notary

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

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.