For rational numbers , , , and , find the total number of different matrices that exist such that
for regular matrix multiplication.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We need to solve the equations a 2 + b c c ( a + d ) = = c d b ( a + d ) b c + d 2 = = a b Thus a 2 − d 2 = c − b and ( b − c ) ( a + d ) = a − d , so that ( a 2 − d 2 ) ( a + d ) ( a − d ) [ ( a + d ) 2 + 1 ] = ( c − b ) ( a + d ) = d − a = 0 and hence a = d , and so b = c = a 2 + b c . Thus we have a = d and b = c and the equations a 2 = b ( 1 − b ) 2 a b = a Thus we can have a = 0 , in which case b = 0 , 1 , or we can have b = 2 1 , in which case a = ± 2 1 . Thus there are 4 posssible matrices: ( 0 0 0 0 ) ( 0 1 1 0 ) ( 2 1 2 1 2 1 2 1 ) ( − 2 1 2 1 2 1 − 2 1 )