erdős #382
Let be such that the largest prime dividing appears with exponent at least . Is it true that ? Can be arbitrarily large?
Worked, still open.
number theory · open · 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 [ A=\prod_{m=u}^v m,\qquad p:=P(A)=\max{ \text{primes }q: q\mid A}, ] and assume the $p$-adic valuation satisfies (v_p(A)\ge 2).
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗oeis
links
Cramér's conjecture · reference
Create a formalisation here · link
status
open