Given A=211−10−1−1−10, B=A−I, and ω=23i−1. Find the number of n∈{1,2,…,100} such that An+(ωB)n=A+B.
Subtracting the identity matrix from A gives:
B=111−1−1−1−1−1−1
Since every row of B is (1,−1,−1), the matrix B has rank 1.
Multiplying B by itself yields:
B2=111−1−1−1−1−1−1111−1−1−1−1−1−1=−1−1−1111111=−B
Thus B2=−B, which implies B3=B. More generally, Bn=B if n is odd and Bn=−B if n is even (for n≥1).
Using the relation A=I+B together with B2=−B, we compute:
A2=(I+B)2=I+2B+B2=I+2B−B=I+B=A
Therefore A2=A, and by induction An=A for all n≥1.
Considering (ωB)n, we note that:
(ωB)n=ωnBn
When n is odd, Bn=B so (ωB)n=ωnB.
When n is even, Bn=−B so (ωB)n=−ωnB.
Substituting into the equation An+(ωB)n=A+B and using An=A leads to:
A+(ωB)n=A+B
(ωB)n=B
In the case of odd n, this requires ωnB=B⟹ωn=1.
In the case of even n, it requires −ωnB=B⟹ωn=−1.
Since ω=2−1+3i=ei⋅2π/3 is a primitive cube root of unity, we have ω3=1.
For odd n, the condition ωn=1 implies n≡0(mod3), and combined with oddness gives n≡3(mod6).
Within the set {1,…,100}, these values are n=3,9,15,…,99, whose number is 699−3+1=17.
For even n, there is no solution because ωn can only be 1,ω,ω2, none of which equals −1.
Hence there are 17 such values of n.