benchmarks.wiki / Public workspace

Omni-MATH / A magician intends to perform the following trick. She announces a positive…

Problem

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

problem

A magician intends to perform the following trick. She announces a positive integer nn, along with 2n2n real numbers x1<…<x2nx_1 < \dots < x_{2n}, to the audience. A member of the audience then secretly chooses a polynomial P(x)P(x) of degree nn with real coefficients, computes the 2n2n values P(x1),…,P(x2n)P(x_1), \dots , P(x_{2n}), and writes down these 2n2n values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?
Plain-text mathematical notation (without MathML)
A magician intends to perform the following trick. She announces a positive integer n, along with 2n real numbers x₁<…<x_(2n), to the audience. A member of the audience then secretly chooses a polynomial P(x) of degree n with real coefficients, computes the 2n values P(x₁),…,P(x_(2n)), and writes down these 2n values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?
Original LaTeX notation
A magician intends to perform the following trick. She announces a positive integer $n$, along with $2n$ real numbers $x_1 < \dots < x_{2n}$, to the audience. A member of the audience then secretly chooses a polynomial $P(x)$ of degree $n$ with real coefficients, computes the $2n$ values $P(x_1), \dots , P(x_{2n})$, and writes down these $2n$ values on the blackboard in non-decreasing order. After that the magician announces the secret polynomial to the audience. Can the magician find a strategy to perform such a trick?

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