Problem:
Find the smallest positive integer such that the polynomial is "divisible by modulo 3", or more precisely, either of the following equivalent conditions holds:
- there exist polynomials with integer coefficients such that ;
- or more conceptually, the remainder when (the polynomial) is divided by (the polynomial) is a polynomial with (integer) coefficients all divisible by 3.
Solution
Solution:
Answer: 8
Solution 1. We have , , and . So the order divides 8, as and are relatively prime polynomials modulo 3 (or more conceptually, in ), but cannot be smaller by our computations of the 2nd and 4th powers.
Solution 2. Here's a solution avoiding the terminology of groups and fields. Let be the remainder (here is the quotient), whose coefficients (upon expansion) must all be divisible by 3. Now consider . The coefficients of the even and odd powers of are divisible by 3, so must have real and imaginary parts divisible by 3. Notice that , , , , and that , which has real and imaginary parts divisible by 3. Since any even power of (for ) yields a purely real or purely imaginary number with a coefficient not divisible by 3, multiplying it by will yield an imaginary part not divisible by 3. To see that works, notice that, when taken modulo 3,
as desired.