erdős #727
Let . Doesfor infinitely many ?
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
Write [ R_{n,k}:=\frac{(2n)!}{(n+k)!^2}. ] Since [ \binom{2n}{n}=\frac{(2n)!}{(n!)^2} \quad\text{and}\quad \frac{(n+k)!}{n!}=\prod_{i=1}^k(n+i), ] we have the exact identity [ R_{n,k} =\frac{(2n)!}{(n!)^2}\cdot\Big(\frac{n!}{(n+k)!}\Big)^2 =\frac{\binom{2n}{n}}{\Big(\prod_{i=1}^k (n+i)\Big)^2}. ] Therefore [ (n+k)!^2\m…
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_727 : answer(sorry) ↔ ∀ k ≥ 2,
Set.Infinite {n : ℕ | (Nat.factorial (n + k)) ^ 2 ∣ Nat.factorial (2 * n)}formal-conjectures/727.lean ↗oeis
links
Catalan numbers · reference
status
open