erdős #913
Are there infinitely many such that ifis the factorisation into distinct primes then all exponents are distinct?
Worked, still open.
number theory · open · formalized (Lean) · 0 attempts
machinery: prime-distribution,bateman-horn,schinzel-hypothesis-H,quadratic-prime-values,powerful-numbers,consecutive-integer-window,admissible-polynomial
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 (v_p(m)) be the exponent of $p$ in $m$. Since (\gcd(n,n+1)=1), [ v_p(n(n+1))=\begin{cases} v_p(n),&p\mid n,[2pt] v_p(n+1),&p\mid n+1. \end{cases} ] So “all exponents in $n(n+1)$ are distinct” is **equivalent** to
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_913 : answer(sorry) ↔
{ n | Set.InjOn (n * (n + 1)).factorization (n * (n + 1)).primeFactors }.Infiniteformal-conjectures/913.lean ↗oeis
links
status
open