Since adj(A)=det(A)⋅A−1 when A is invertible
taking determinants on both sides gives
det(adj(A))=(det(A))n⋅det(A−1)=(det(A))n⋅det(A)1=(det(A))n−1.
For n=3, this becomes
det(adj(A))=(det(A))2.
Let Dk be the determinant after applying the adjoint operation k times.
We have
D0=det(A)=2,
and each adjoint operation squares the determinant, so
D1=D02=22=4,
D2=D12=42=24,
D3=D22=(24)2=28.
In general, one finds
Dk=22k.
D2024mod9 = 222024mod9.
To proceed, we note the pattern of powers of 2 modulo 9:
21=2,22=4,23=8,24=16≡7,25=32≡5,26=64≡1(mod9).
Thus the cycle length is 6, so the value of 2mmod9 depends only on mmod6.
We next determine 22024mod6 by computing it modulo 2 and modulo 3 separately
22024mod2=0.
Moreover, because 2≡−1(mod3),
22024≡(−1)2024=1(mod3).
By the Chinese Remainder Theorem, the unique solution modulo 6 satisfying these conditions is
22024≡4(mod6).
It follows that
222024≡24=16≡7(mod9).