Maths Olympiad Prep

Library / /1317 of 1394

Number theory Difficulty 6.1 National Olympiad Prove it United States

Problem:
Find the smallest positive integer nn such that the polynomial (x+1)n1(x+1)^{n}-1 is "divisible by x2+1x^{2}+1 modulo 3", or more precisely, either of the following equivalent conditions holds:
- there exist polynomials P,QP, Q with integer coefficients such that (x+1)n1=(x2+1)P(x)+3Q(x)(x+1)^{n}-1=\left(x^{2}+1\right) P(x)+3 Q(x);
- or more conceptually, the remainder when (the polynomial) (x+1)n1(x+1)^{n}-1 is divided by (the polynomial) x2+1x^{2}+1 is a polynomial with (integer) coefficients all divisible by 3.

Solution

Solution:
Answer: 8

Solution 1. We have (x+1)2=x2+2x+12x(x+1)^{2}=x^{2}+2x+1 \equiv 2x, (x+1)4(2x)241(x+1)^{4} \equiv (2x)^{2} \equiv -4 \equiv -1, and (x+1)8(1)2=1(x+1)^{8} \equiv (-1)^{2}=1. So the order nn divides 8, as x+1x+1 and x2+1x^{2}+1 are relatively prime polynomials modulo 3 (or more conceptually, in F3[x]\mathbb{F}_{3}[x]), 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 R(x)=(x+1)n1P(x)(x2+1)=3Q(x)R(x)=(x+1)^{n}-1-P(x)(x^{2}+1)=3Q(x) be the remainder (here PP is the quotient), whose coefficients (upon expansion) must all be divisible by 3. Now consider R(i)R(i). The coefficients of the even and odd powers of xx are divisible by 3, so R(i)R(i) must have real and imaginary parts divisible by 3. Notice that (1+i)2=2i(1+i)^{2}=2i, (1+i)4=4(1+i)^{4}=-4, (1+i)6=8i(1+i)^{6}=-8i, (1+i)8=16(1+i)^{8}=16, and that (1+i)81=15(1+i)^{8}-1=15, which has real and imaginary parts divisible by 3. Since any even power of (1+i)(1+i) (for n6n \leq 6) yields a purely real or purely imaginary number with a coefficient not divisible by 3, multiplying it by 1+i1+i will yield an imaginary part not divisible by 3. To see that n=8n=8 works, notice that, when taken modulo 3,
(x+1)81=x8+8x7+28x6+56x5+70x4+56x3+28x2+8xx8x7+x6x5+x4x3+x2x=(x2+1)(x6x5+x2x)(mod3), \begin{aligned} (x+1)^{8}-1 & = x^{8} + 8x^{7} + 28x^{6} + 56x^{5} + 70x^{4} + 56x^{3} + 28x^{2} + 8x \\ & \equiv x^{8} - x^{7} + x^{6} - x^{5} + x^{4} - x^{3} + x^{2} - x \\ & = (x^{2}+1)(x^{6} - x^{5} + x^{2} - x) \quad (\bmod 3), \end{aligned}
as desired.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.