{"schema":"vela.problem-packet.v0.1","problem":210,"statement":"Let $f(n)$ be minimal such that the following holds. For any $n$ points in $\\mathbb{R}^2$, not all on a line, there must be at least $f(n)$ many lines which contain exactly 2 points (called 'ordinary lines'). Does $f(n)\\to \\infty$? How fast?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A003034","name":"Sylvester's problem: minimal number of ordinary lines through n points in the plane.","terms":"3,3,4,3,3,4,6,5,6,6,6,7","url":"https://oeis.org/A003034"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}