olymmath

Putnam 2008 A5

  • Session A

Let n≥3n \geq 3 be an integer. Let f(x)f(x) and g(x)g(x) be polynomials with real coefficients such that the points (f(1),g(1)),(f(2),g(2)),…,(f(n),g(n))(f(1), g(1)), (f(2), g(2)), \dots, (f(n), g(n)) in R2\mathbb{R}^2 are the vertices of a regular nn-gon in counterclockwise order. Prove that at least one of f(x)f(x) and g(x)g(x) has degree greater than or equal to n−1n-1.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator putnam/2008/a5 · Tag KYRFHYVP9V · Edit this page on GitHub · Keys: j next, k previous