Skip to content

Erdős problem 798

Let t(n)t(n) be the minimum number of points in {1,…,n}2\{1,\ldots,n\}^2 such that the (t2)\binom{t}{2} lines determined by these points cover all points in {1,…,n}2\{1,\ldots,n\}^2.

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal3 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it109 share a topic
Erdős problem 94accepted
Carrying a Standing. Browse the topic.