{"schema":"vela.problem-packet.v0.1","problem":882,"statement":"What is the size of the largest $A\\subseteq \\{1,\\ldots,n\\}$ such that in the set\\[\\left\\{ \\sum_{a\\in S} a : \\emptyset\\neq S\\subseteq A\\right\\}\\]no two distinct elements divide each other?","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)"}