Solution:
1st Solution: Define the polynomial P(x)=x3−36x2+51x−97. Starting from P0(x)=811P(9x+1)=9x3−33x2−2x−1, define recursively polynomials Pk(x)=3akx3+3bkx2+ckx+dk with integers ak,bk,ck,dk, where ck is not divisible by 3, and Pk+1(x)=31Pk(3x+εk) with εk∈{−1,0,1} for all k: Since ck is not divisible by 3, one can choose εk such that εkck+dk is divisible by 3; then 31Pk(3x+εk)=3ak+1x3+3bk+1x2+ck+1x+dk+1 with ak+1=9ak,bk+1=9εkak+3bk, ck+1=3(3εk2ak+2εkbk)+ck,dk+1=εk3ak+εk2bk+(εkck+dk)/3, so ck+1 is also not divisible by 3.
Setting x2004=0 and recursively xk=3xk+1+εk, i.e. Pk(xk)=3Pk(xk+1) for k=2003,…,0, then for a=9x0+1 the number P(a)=81⋅32004P2004(x2004) is a multiple of 32008.
2nd Solution: Define the polynomial P(x)=x3−36x2+51x−97. For k≥4, integers ak with ak≡1mod9 and 3k∣P(ak) are constructed inductively; the problem statement is then satisfied by a=a2008:
Base case k=4: For a4=1 we have 34∣P(a4).
Induction step k→k+1: For k≥4 we have 2k−3≥k+1 and 3k−6>k+1, so for
all integer x:
P(x+3k−2)−P(x)≡3k−1x2+32k−3x+33k−6−36(2⋅3k−2x+32k−4)+51⋅3k−2≡3k−1(x2−24x+17)mod3k+1
For x≡1mod9 we have x2−24x+17≡1−24+17≡3mod9. Because k≥4 we also have x≡x+3k−2mod9. Therefore the difference 3k−1(x2−24x+17) contains the prime factor 3 exactly k times, so P(u) is divisible by 3k+1 for u=ak or u=ak+3k−2 or u=ak+2⋅3k−2; set ak+1 to this value of u. By construction ak+1≡1mod9.