Difference between revisions of "1997 USAMO Problems/Problem 3"
(Created page with "== Problem == Prove that for any integer <math>n</math>, there exists a unique polynomial <math>Q</math> with coefficients in <math>\{0,1,...,9\}</math> such that <math>Q(-2)=Q(-...") |
(Blanked the page) |
||
Line 1: | Line 1: | ||
− | |||
− | |||
− |