The rank is the maximal number of linearly independant rows in the matrix.
1. Subtract twice the first row from the second:
1 3 3
0 -1 2
1 0 7
2. Subtract The first row from the third:
1 3 3
0 -1 2
0 -3 6
3. Subtract 3 times the 2nd row from the 3rd row
1 3 3
0 -1 2
0 0 0
At the end of the process you have one row of zeros, and two linearly independant rows, thus the rank is 2.
2007-04-05 18:54:44
·
answer #1
·
answered by Amit Y 5
·
1⤊
0⤋
TRUE Call f the mapping on R^3 such that f(X) = AX, call E_j = Im f^j and K = Kef f Then Rank(A^j) = Rank(A^(j+1)) <===> E_j and F are disjoint. But if k>j, then E_k and F are disjoint. Hence Rank(A^j) = Rank(A^(j+1)) ====> Rank(A^k) = Rank(A^(k+1)) Now, Rank f^0, f^1,f^2,f^3,f^4 can't all distinct since there are only 4 possible values for the ranks. Hence for one j <= 3, Rank(A^j) = Rank(A^(j+1)). Hence Rank(A^k) is constant for k >= 3.
2016-04-01 00:10:10
·
answer #2
·
answered by Anonymous
·
0⤊
0⤋
How do you mean rank? Well if I'm interpreting your qusetion correctly, square it. And if you get ties, you cube it. still getting ties? that plus that squared. if you're stlil getting ties, then that plus that squared plus that cubed. not sure if you can do it on a normal graphic calculator, usually i'd do it on excel.
2007-04-05 18:49:41
·
answer #3
·
answered by mrsjoshgroban 1
·
0⤊
1⤋