erdős #1072
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_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
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
A072937 — Least k such that prime(n) appears in factorization of k! + 1.2,4,3,5,12,16,9,14,18,30,36,40,21,23,52,15,8,18,7,72,23,13,88,96,100,6,106,86,112,63,65,16,16,50,150,156,81,166,172,89,1A073944 — a(n) is the smallest m such that n-th prime divides m! + 1.1,2,4,3,5,12,16,9,14,18,30,36,40,21,23,52,15,8,18,7,72,23,13,88,96,100,6,106,86,112,63,65,16,16,50,150,156,81,166,172,89A154554 — Primes p such that m=p-1 is the least number such that p divides m!+1.2,3,5,13,17,31,37,41,53,73,89,97,101,107,113,151,157,167,173,181,197,211,223,229,241,281,283,313,331,337,349,353,373,409
status
open