✦ 5 frontiers

read-only vieweressays

erdős #798

← #797 · #799 → (packet.json; erdosproblems.com)

Let $t (n)$ be the minimum number of points in ${1, \dots, n}^{2}$ such that the $(2 t)$ lines determined by these points cover all points in ${1, \dots, n}^{2}$ .Estimate $t (n)$ . In particular, is it true that $t (n) = o (n)$ ?

Worked, still open.

geometry · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

oeis

A116446 — 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 t1,4,4,4,6,6,7,8,8,8

links

Create a formalisation here · link

status

solved

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub