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.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:6e1dbc271ed1d95ab256a3e97e29c267271c1f2ca6afaf7521f544f445a36c3f
Metadata
sha256:ee5b800f3a8d3626a728dab4be1028a84c61195e5837ca9e476934251ea320df
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:0b2272fc2916269af44e5c0b4065544c09f1a97fa95998c9bced45ffa9d7ccde
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb