Vela

Let count the number of such that . Is it true that, for every , there exist 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

If we write (A(n):=|\\{m:\varphi(m)=n\\}|), then your (g(n)=A(n)). What you are asking is whether

candidate solution ↗

llm-hunter · gpt pro 5.2 · unverified

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

candidate solution ↗

oeis

status

open

notary

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

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.