If AAA is a square n×nn \times nn×n matrix and det(A)=0\det(A) = 0det(A)=0, which statement is definitely true?
rank(A)=nrank(A) = nrank(A)=n
Ax=0Ax = 0Ax=0 has only the trivial solution
rank(A)<nrank(A) < nrank(A)<n
Ax=bAx = bAx=b is always consistent