{"schema":"vela.problem-packet.v0.1","problem":434,"statement":"Let $k\\leq n$. What choice of $A\\subseteq \\{1,\\ldots,n\\}$ (with $\\mathrm{gcd}(A)=1$) of size $\\lvert A\\rvert=k$ maximises the number of integers not representable as the sum of finitely many elements from $A$ (with repetitions allowed)? Is it $\\{n,n-1,\\ldots,n-k+1\\}$?","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)"}