matrices why can't they be divided?
912333
Well you can, in a sense.\nI don't know a SIMPLE way to do it, in the sense that there is a SIMPLE way to do matrix multiplication. But maybe the following explanation will be helpful:\n\nIf [A] x [B] = [C] (i.e., if the product of matrices A and B equals matrix C), then we can say that [C] / [B] = [A]. So in that sense, we are dividing C by B.\n\nBut what if we don't know matrix A. What if we know only [B] and [C]? How can we divide [C] by [B] to find [A]?\n\nThe answer is that we find the "inverse" of matrix B, and then MULTIPLY matrix C by this inverse matrix (which is shown as [B]^-1). We define [B]^-1 as the matrix for which [B] x [B]^-1 = the identity matrix. (The identity matrix is a square matrix that has 1's on its main diagonal and 0's everywhere else.)\n\nThe problem, then, becomes how to find the inverse of [B]. Fortunately, there are procedures for this, and you can probably find them on line using Google. Not all matrices can be inverted. But if B can be inverted, then you have:\n\n[C] / [B] = [C] x [B]^-1 = [A]\n\nNote that if we substitute [A] x [B] for [C], then this becomes;\n([A] x [B]) / [B] = [A] x [B] x [B]^-1 = [A] x identity matrix = [A]
201316
This website may help you.  Good luck.\n\nhttp://www.sosmath.com/matrix/matrix.html
542644
Here are a few websites which explain it fairly well...\n\nhttp://www.mai.liu.se/~halun/matrix/\n\nhttp://www.easycalculation.com/matrix/matrix-multiplication.php\n\nThat one has a matrix calculator online. Good luck!
858552
Have you tried these?  Surely you've been told that division by 0 isn't possible, so there's your answer for 7.  I'm not doing any others on Yahoo answers (too many at once), but if you really need help and are willing to do as much as possible for yourself I'll help you if you email h_chalker@yahoo.com.au, but nasty Maths teachers like me won't just hand you 7 answers on a plate!
434590
because in more complex fields of mathematics, equations are as yet unsolvable, and the best we can do is make approximations. in fact there is an entire field of math devoted to this.
909215
It can be encoded with another 1*2 matrix through addition.\n\nFor example,\n\noriginal matrix = (x   y)\n\nencoding matrix = (a b)\n\nCoded matrix = (x+a    y+b)
252498
block matrices are those with equal number of rows and columns.\n\nex:\n\n1 1 1\n1 2 2 \n3 4 5\n\nthat's a 3x3 matrix.  same number of rows and columns.\n\nthey're the only matrices that can be multiplied. \n\nmatrices can never be divided by another matrix.
607889
can only be divided by 1 and themselves
1126894
This normally means that you are going to be using Gaussian (or Gauss-Jordan) reduction, where ther eare three "moves" that are allowed.\n\n1) You can switch any two rows in the matrix.\n2) You can multiply any row in the matrix by a non-zero scalar.\n3) You can add a multiple of one row to another.\n\nUsing these three "moves," the goal is to reduce the matrix into a usable form (the echelon form, for example).
1336
Besides large systems of equations, matrices are also useful to solve for efficient portfolios.  The relationships between various asset classes are grouped in a "covariance matrix".  The variance of the portfolio can be calculated using simple matrix multiplication of the covariance matrix and the allocation to the portfolio.\n\nAlso, matrices are used in optimization problems, and regression analysis.
579225
Division by zero is undefined, even if you divide zero into zero.\n\nhttp://en.wikipedia.org/wiki/Division_by_zero
1017458
symetric properety...\n\n\nok heres why.....\n\n(pretend the equal signs are parallel line segments)\n\n===========================\n\n\ndo you see how you can split them dont the middle, thats called the symetric property
350177
Sometimes adding some indents will help figure out what's going on.  In your algorithm, you have a lot of nested if and while statements, so space them out like this first to see how each is related to each other (I'm using periods because Yahoo won't show spaces):\n\ni <- 0\nwhile (i < n) do\n...j <- i+1\n...m <- a[i]\n...while (j < n) do\n......if (m > a[j]) then\n.........m <- a[j]\n......end if\n......j <- j + 1\n...end while\n...b[i] <- m\n...i <- i + 1\nend while\n\nYour i is a counter that starts with 0, and your j is a counter that starts with 1.  j will always be more than i.\n\nThe "while (i < n) do" line limits this algorithm to 3 loops, since n is 3.\n\nDirectly after this statement, j is established as a counter, and m is defined to be the i-th element of your matrix.  The next while statement then compares m (the i-th element in the matrix) to the element after this (using j to read the next element).\n\nIf m is larger, then the if statement makes m take on the smaller value.  If m is smaller, nothing happens and j is indexed to the next value.  Then the process repeats itself.  If we get to the end of the matrix and m isn't replaced anymore, it becomes the i-th value in matrix B.  After this, i is indexed to the next element in matrix A and the entire process is repeated once again, until all of matrix A has been checked.\n\nThe result then is that through m, matrix A is sorted least to greatest and is written into matrix B, which is answer (d).
599681
It depends on exactly what you mean by a matrix. If you're talking about multi-dimensional or nested arrays in ActionScript, then here is a link to get you started...
391281
meaning it can't be expressed algebraically
438919
I dont know how to put this up here. I tried to put it in a nice format, but it would accept.\nBut you put the following in one matrix \n-2  6\n+2  2\n\nThen you put a * (multiply)\n\nThen you put the following in one more matrix\n\nx\ny\n\n\nThen put an ' = ' symbol\n\nThen put the following in a matrix\n\n40\n8
882621
My old math teacher showed me this.\n\nSince A=B, then A-B=0, and you can't divide by 0