Vela

For any prime , let be the least integer such that .Is it true that there are infinitely many for which ?Is it true that for almost all ?

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 $p$ be prime and [ f(p):=\min{n\ge 1:\ n!\equiv -1 \pmod p}. ] By Wilson’s theorem ((p-1)!\equiv -1\pmod p), so $f(p)$ is always defined and (f(p)\le p-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_1072.parts.i : answer(sorry) ↔ Set.Infinite {p | p.Prime ∧ f p = p - 1}
formal-conjectures/1072.lean ↗

oeis

status

open

notary

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

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.