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

Human solution Solution 1 by Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

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