olymmath

USAMO 1997 Problem 3

  • Day 1

Prove that for any integer nn , there exists a unique polynomial QQ with coefficients in {0,1,…,9}\{0,1,\ldots,9\} such that Q(−2)=Q(−5)=nQ(-2) = Q(-5) = n .

Dataset text AI-MO AoPS. 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 usamo/1997/p3 · Tag R4Z5FAATEN · Edit this page on GitHub · Keys: j next, k previous