{"schema":"vela.problem-packet.v0.1","problem":46,"statement":"Does every finite colouring of the integers have a monochromatic solution to $1=\\sum \\frac{1}{n_i}$ with $2\\leq n_1<\\cdots <n_k$?","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)"}