{"schema":"vela.problem-packet.v0.1","problem":896,"statement":"Estimate the maximum of $F(A,B)$ as $A,B$ range over all subsets of $\\{1,\\ldots,N\\}$, where $F(A,B)$ counts the number of $m$ such that $m=ab$ has exactly one solution (with $a\\in A$ and $b\\in B$).","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)"}