benchmarks.wiki / Public workspace
OlympiadBench / 1620 / Let n≥2 be an integer, and let f be a 4n-variable polynomial…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
question
Let be an integer, and let be a -variable polynomial with real coefficients. Assume that, for any points in the plane, if and only if the points form the vertices of a regular -gon in some order, or are all equal.
Determine the smallest possible degree of .
Plain-text mathematical notation (without MathML)
Let n≥2 be an integer, and let f be a 4n-variable polynomial with real coefficients. Assume that, for any 2n points (x₁,y₁),…,(x_(2n),y_(2n)) in the plane, f(x₁,y₁,…,x_(2n),y_(2n))=0 if and only if the points form the vertices of a regular 2n-gon in some order, or are all equal. Determine the smallest possible degree of f.
Original LaTeX notation
Let $n \geqslant 2$ be an integer, and let $f$ be a $4 n$-variable polynomial with real coefficients. Assume that, for any $2 n$ points $\left(x_{1}, y_{1}\right), \ldots,\left(x_{2 n}, y_{2 n}\right)$ in the plane, $f\left(x_{1}, y_{1}, \ldots, x_{2 n}, y_{2 n}\right)=0$ if and only if the points form the vertices of a regular $2 n$-gon in some order, or are all equal.
Determine the smallest possible degree of $f$.answer type
Expression
is multiple answer
false
language
English
question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import