{"schema":"vela.problem-packet.v0.1","problem":783,"statement":"Fix some constant $C>0$ and let $N$ be large. Let $A\\subseteq \\{2,\\ldots,N\\}$ be such that $(a,b)=1$ for all $a\\neq b\\in A$ and $\\sum_{n\\in A}\\frac{1}{n}\\leq C$.What choice of such an $A$ minimises the number of integers $m\\leq N$ not divisible by any $a\\in A$?","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)"}