Vela

Let . Is it true that, for all large , the number of divisors of in is ?

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 $ D_n(X,Y):=|\\{d\mid n:\ X<d\le X+Y\\}|. $ Your question is exactly the assertion that for each fixed (\epsilon>0), $ D_n(n^{1/2},n^{1/2-\epsilon})=O_\epsilon(1)\quad\text{as }n\to\infty. $ It appears explicitly as **Conjecture 1** in a 2025 preprint of Letendre (in essentially the same notation). ([arXiv][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 · open (literature)

theorem erdos_886 :
    answer(sorry) ↔ ∀ ε > 0, ∃ K : ℕ, ∀ᶠ n in atTop, (Erdos886Divisors n ε 1).card ≤ K
formal-conjectures/886.lean ↗

status

open

notary

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

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.