{"schema":"vela.problem-packet.v0.1","problem":1190,"statement":"Let\\[\\epsilon_m=\\max \\sum \\frac{1}{n_i}\\]where the maximum is taken over all finite sequences $m<n_1<\\cdots<n_k$ for which there exist congruences $a_i\\pmod{n_i}$ such that no integer satisfies two such congruences. Estimate $\\epsilon_m$.","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)"}