MathDB
Polynomial

Source: USAMO 1997

October 9, 2005
algebrapolynomialUSAMOalgorithm

Problem Statement

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.