{"schema":"vela.problem-packet.v0.1","problem":373,"statement":"Show that the equation\\[n! = a_1!a_2!\\cdots a_k!,\\]with $n-1>a_1\\geq a_2\\geq \\cdots \\geq a_k\\geq 2$, has only finitely many solutions.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A003135","name":"n! is a nontrivial product of factorials. It is conjectured that the list is complete.","terms":"9,10,16","url":"https://oeis.org/A003135"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}