この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #960

Full solution by OpenAI internal model (9 Apr 2026).

問題
Erdős problem #960 (geometry); current status: disproved
貢献
OpenAI internal model · AI on its own
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-09 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
完全解Per Tao's AI-contributions wiki

The problem

Let r,k≥2r,k\geq 2 be fixed. Let A⊂R2A\subset \mathbb{R}^2 be a set of nn points with no kk points on a line. Determine the threshold fr,k(n)f_{r,k}(n) such that if there are at least fr,k(n)f_{r,k}(n) many ordinary lines (lines containing exactly two points) then there is a set A′⊆AA'\subseteq A of rr points such that all (r2)\binom{r}{2} many lines determined by A′A' are ordinary.

Is it true that fr,k(n)=o(n2)f_{r,k}(n)=o(n^2), or perhaps even ≪n\ll n?

Statement quoted from erdosproblems.com/960, maintained by Thomas Bloom. Original source: [Er84,p.102]. Current status there: disproved.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Outcome
9 Apr, 2026 AI on its own OpenAI internal model 🟢 Full solution

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎