{"schema":"vela.problem-packet.v0.1","problem":681,"statement":"Is it true that for all large $n$ there exists $k$ such that $n+k$ is composite and\\[p(n+k)>k^2,\\]where $p(m)$ is the least prime factor of $m$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A389680","name":"Numbers k for which no i > 1 exists such that k + i is composite and its least prime factor exceeds i^2.","terms":"1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,24,25,26,27,28,29,30,31,32,34,35,36,37,38,39,40,41,42,43,44,45,","url":"https://oeis.org/A389680"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}