{"schema":"vela.problem-packet.v0.1","problem":634,"statement":"Find all $n$ such that there is at least one triangle which can be cut into $n$ congruent triangles.","status":"open","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)"}