Let R={(a3bc2d050): a,b,c,d∈{0,3,5,7,11,13,17,19}}. Then the number of invertible matrices in R is [2023]
(3780)
Let us calculate when |R|=0
Case I: ad=bc=0
If ad=0 (when none of a and d is 0),
Total=82-1=15 ways
Similarly, bc=0⇒15 ways
∴ 15×15=225 ways for ad=bc=0
Case II: ad=bc≠0
Either a=d=b=c or a≠d, b≠c but ad=bc
C17=7 ways or C27×2×2=84 ways
Total=7+84=91 ways
∴ |R|=0 in 225+91=316 ways
|R|≠0 in 84-316=3780