benchmarks.wiki / Public workspace

Omni-MATH / A finite set S of points in the coordinate plane is called [i]overdetermined[/i] if |S|≥2 and there exists a nonzero polynomial P(t), with real coefficients and of degree at most …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

A finite set SS of points in the coordinate plane is called [i]overdetermined[/i] if |S|≥2|S|\ge 2 and there exists a nonzero polynomial P(t)P(t), with real coefficients and of degree at most |S|−2|S|-2, satisfying P(x)=yP(x)=y for every point (x,y)∈S(x,y)\in S. For each integer n≥2n\ge 2, find the largest integer kk (in terms of nn) such that there exists a set of nn distinct points that is [i]not[/i] overdetermined, but has kk overdetermined subsets.
Plain-text mathematical notation (without MathML)
A finite set S of points in the coordinate plane is called [i]overdetermined[/i] if |S|≥2 and there exists a nonzero polynomial P(t), with real coefficients and of degree at most |S|−2, satisfying P(x)=y for every point (x,y)∈S. 
 
For each integer n≥2, find the largest integer k (in terms of n) such that there exists a set of n distinct points that is [i]not[/i] overdetermined, but has k overdetermined subsets.
Original LaTeX notation
A finite set $S$ of points in the coordinate plane is called [i]overdetermined[/i] if $|S|\ge 2$ and there exists a nonzero polynomial $P(t)$, with real coefficients and of degree at most $|S|-2$, satisfying $P(x)=y$ for every point $(x,y)\in S$. 
 
For each integer $n\ge 2$, find the largest integer $k$ (in terms of $n$) such that there exists a set of $n$ distinct points that is [i]not[/i] overdetermined, but has $k$ overdetermined subsets.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import