Number theoryDifficulty 7.2Prove itAuswahlwettbewerb zur Internationalen Mathematik-Olympiade · Germany
Let n be a positive integer and let b be the largest integer that is smaller than (328−3)−n. Prove that b cannot be divisible by 6.
This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.
The complex number ω=2−1+3i is, as is well known, a cube root of unity and satisfies ω2=2−1−3i, ω3=1 and ω2+ω+1=0; in particular 1+ωj+ω2j={3,0 if j is divisible by three otherwise. Set rk=328ωk−3 for k=0,1,2. By the definition of b we have r0−n−b<1; since the real parts of ω and ω2 are negative, we have ∣r1∣>1 and ∣r2∣>1. Thus b−(r0−n+r1−n+r2−n)<b−r0−n+r1−n+r2−n<3. Since (328ωk)3=28, we have rk−1=328ωk−31=328ωk−3(328ωk)3−33=3282ω2k+3328ωk+9 If one raises the polynomial X2+3X+9 to the n-th power, there exist integers c0,…,c2n with (X2+3X+9)n=c2nX2n+c2n−1X2n−1+…+c0, where c0=9n is odd. Substituting X=328ωk gives rk−n=∑j=02ncj328jωkj; from this, using (1), we obtain: r0−n+r1−n+r2−n=j=0∑2ncj328j(1+ωj+ω2j)=30≤ℓ≤2n/3∑c3ℓ28ℓ The sum is clearly a multiple of 3 and, moreover, odd, since the summand c3ℓ28ℓ is odd for ℓ=0 and even for ℓ>0. If b were divisible by 6, then the absolute value b−(r0−n+r1−n+r2−n) would be at least 3, contradicting (2).
Source: MathNet,
licensed CC-BY-4.0.
Statement translated into English from de; metadata (topic, difficulty, ordering) added by this project.