Vela

Let (where counts the number of divisors of ) and . Is it true, for any , there exist and such that ?

Worked, still open.

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

Let (h(n)=n+\tau(n)) and (h_k=h^{\circ k}) as you defined.

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_414 : answer(sorry) ↔ ∀ᵉ  (m > 0) (n > 0), ∃ i j, h^[i] m = h^[j] n
formal-conjectures/414.lean ↗

oeis

status

open

notary

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

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.