{"schema":"vela.problem-packet.v0.1","problem":502,"statement":"What is the size of the largest $A\\subseteq \\mathbb{R}^n$ such that there are only two distinct distances between elements of $A$? That is,\\[\\# \\{ \\lvert x-y\\rvert : x\\neq y\\in A\\} = 2.\\]","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A027627","name":"Maximal cardinality of 2-distance set in R^n.","terms":"3,5,6,10,16,27,29,45","url":"https://oeis.org/A027627"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}