{"schema":"vela.problem-packet.v0.1","problem":1073,"statement":"Let $A(x)$ count the number of composite $u&#60;x$ such that $n!+1\\equiv 0\\pmod{u}$ for some $n$. Is it true that $A(x)\\leq x^{o(1)}$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A256519","name":"Composites c for which an integer 1 < k < c exists such that (c-k)! == -1 (mod c).","terms":"25,121,169,437,551,667,721,1037,1159,1273,1349,1403,1541,1769,1943,2209,2329,2363,2419,3071,3713,4087,5041,5111,7313,835","url":"https://oeis.org/A256519"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}