If the condition is
A=A−1,
then
A2=I
Let
A=[acbd]
where
a,b,c,d∈{−1,0,1,2,…,10}
Now,
A2=[a2+bcac+cdab+bdd2+bc]
Since
A2=I,
we get
a2+bc=1⋯(1)
d2+bc=1⋯(2)
b(a+d)=0⋯(3)
c(a+d)=0⋯(4)
From (1) and (2),
a2=d2
Hence,
a=dora=−d
Case 1: a=−d
Then equations (3) and (4) are automatically satisfied.
Using
a2+bc=1
Subcase (i): a=1, d=−1
1+bc=1
bc=0
Number of ordered pairs satisfying
bc=0
is
12+12−1=23
(Subtracting one for double counting b=c=0)
Subcase (ii): a=−1, d=1
Again,
bc=0
Hence, number of matrices is
23
Subcase (iii): a=0, d=0
Then,
bc=1
Possible ordered pairs are
(1,1), (−1,−1)
Hence, number of matrices is
2
Total from Case 1:
23+23+2=48
Case 2: a=d
From (3) and (4),
b(2a)=0,c(2a)=0
Subcase (i): a=d=1
Then,
b=0, c=0
giving
1
matrix.
Subcase (ii): a=d=−1
Again,
b=0, c=0
giving
1
matrix.
Total from Case 2:
1+1=2
Therefore, total number of matrices is
48+2=50
Hence, the required number of matrices is
50.