{"schema":"vela.problem-packet.v0.1","problem":698,"statement":"Is there some $h(n)\\to \\infty$ such that for all $2\\leq i<j\\leq n/2$\\[\\textrm{gcd}\\left( \\binom{n}{i},\\binom{n}{j}\\right) \\geq h(n)?\\]","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}