{"schema":"vela.problem-packet.v0.1","problem":798,"statement":"Let $t(n)$ be the minimum number of points in $\\{1,\\ldots,n\\}^2$ such that the $\\binom{t}{2}$ lines determined by these points cover all points in $\\{1,\\ldots,n\\}^2$.Estimate $t(n)$. In particular, is it true that $t(n)=o(n)$?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A116446","name":"Let Sq(n) denote the square grid consisting of all lattice points (x,y) such that x,y are in {0,1,...,n}. a(n) is the minimum number t such that there are t of the (n+1)^2 lattice points in Sq(n) so t","terms":"1,4,4,4,6,6,7,8,8,8","url":"https://oeis.org/A116446"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}