2008 iTest Problems/Problem 80
Problem
Let
![$p(x) = x^{2008} + x^{2007} + x^{2006} + \cdots + x + 1,$](http://latex.artofproblemsolving.com/2/0/4/2041dade3e62a86d00fe5ef9f77aa0ea17f8a0f8.png)
and let be the polynomial remainder when
is divided by
. Find
the remainder when
is divided by
.
Solutions
Solution 1
. We apply the polynomial generalization of the Chinese Remainder Theorem.
Indeed,
![$p(x) = (x^{2008} + x^{2007} + x^{2006}) + \cdots + (x^4 + x^3 + x^2) + x + 1 \equiv x+1 \pmod{x^2 + x + 1}$](http://latex.artofproblemsolving.com/b/6/b/b6bc97634119277276b24990ea3cc201cefbe434.png)
since . Also,
![$p(x) = (x^{2008} + x^{2006}) + (x^{2007} + x^{2005}) + \cdots + (x^4 + x^2) + (x^3 + x) + 1 \equiv 1 \pmod{x^2 + 1}$](http://latex.artofproblemsolving.com/6/e/1/6e12f6c557759aa02a92a59541b1970a17d65d85.png)
using similar reasoning. Hence , and by CRT we have
.
Then .
Solution 2
The given information can be represented as
where
is the remainder and
is the quotient. Multiplying both sides by
would make computation easier; doing so results in
Now plug in values of
not equal to 1 that make
. By the Zero Product Property, the values of
that make the expression equal to 0 are
and
.
By plugging in and
into the equation and solving for the remainder function, we have
. Since the remainder function's degree is at most 3 and we know four points, we can construct the unique remainder function.
Let . Plugging in
results in
, and plugging in
results in
. Thus,
and
. Plugging in
results in
. Plugging in
results in
. Thus,
and
, so
Substituting
results in
and
. Therefore,
, so
, and the remainder when divided by 1000 is
.
See Also
2008 iTest (Problems) | ||
Preceded by: Problem 79 |
Followed by: Problem 81 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 • 41 • 42 • 43 • 44 • 45 • 46 • 47 • 48 • 49 • 50 • 51 • 52 • 53 • 54 • 55 • 56 • 57 • 58 • 59 • 60 • 61 • 62 • 63 • 64 • 65 • 66 • 67 • 68 • 69 • 70 • 71 • 72 • 73 • 74 • 75 • 76 • 77 • 78 • 79 • 80 • 81 • 82 • 83 • 84 • 85 • 86 • 87 • 88 • 89 • 90 • 91 • 92 • 93 • 94 • 95 • 96 • 97 • 98 • 99 • 100 |