Given that is a non-constant monic polynomial with the property that is divisible by 8 for all integers , find the smallest possible degree of .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let f ( x ) = ( x + a ) ( x + a + 1 ) ( x + a + 2 ) ( x + a + 3 ) for any integer a . Then, in any given four consecutive integers, exactly two of them are divisible by 2 and exactly one of them is divisible by 4, so their product is always divisible by 8. The degree of f ( x ) is then 4
We then try to do better than this. Suppose a cubic polynomial p ( x ) of the form x 3 + a x 2 + b x + c satisfies. Obviously, p ( 0 ) must satisfy, so ( 0 ) 3 + a ( 0 ) 2 + b ( 0 ) + c ≡ c ≡ 0 ( m o d 8 ) . So, c ≡ 0 ( m o d 8 ) .
We continue working mod 8. We see that p ( 1 ) = 1 + a + b + c ≡ 1 + a + b ( m o d 8 ) ≡ 0 ( m o d 8 ) , so a + b ≡ − 1 ( m o d 8 ) .
But then, p ( − 1 ) = − 1 + a − b + c ≡ − 1 + a − b ( m o d 8 ) ≡ 0 ( m o d 8 ) , so b − a ≡ − 1 ( m o d 8 ) .
From here we can deduce that a ≡ 0 ( m o d 8 ) , b ≡ − 1 ( m o d 8 ) . So, taking p ( x ) ( m o d 8 ) ,
p ( x ) = x 3 + a x 2 + b x + c ≡ ( x 3 − x ) ( m o d 8 ) . We then see that p ( 2 ) does not satisfy p ( 2 ) ≡ 0 ( m o d 8 ) , thus a contradiction. We can also follow the steps above to disprove the possibility of p ( x ) being quadratic. In fact, paragraphs 3 to 5 have already done so, only that all the terms are multiplied with x . Just divide by x and the proof for the quadratic case is done.
Finally, if p ( x ) is linear, then p ( x ) = x + c , which must be divisible by 8 for all x , which is absurd. Therefore, only quartic equations satisfy.