MATHEMATICS II - Deneme Sınavı - 13
II. For an m×n matrix these mn numbers are called entries of this matrix.
III. Matrices are denoted by lowercase letters and entries of matrices are denoted by capital letters always.
What can be said to be true about matrices?
II. If a matrix A has an inverse, A is called invertible if such an inverse does not exist, A is called singular.
III. The inverse matrix can be defined for a nonsquare matrix also all square matrices possess inverses.
What can be said to be true about inverse matrices?
II. The lines may be parallel and distinct, in which case there is an intersection point therefore
the system has one solution.
III. The lines may coincide, in which case there are infinitely many intersection points and
consequently the system has infinitely many solutions.
For a system of linear equations with graphs of these equations' lines in the xy-plane what can be said to be true?
4x + 6y = 10
6x – 4y = 2
which of the given x and y pairs is the solution of the linear system
II. The method of finding solutions of systems of linear equations using determinants of matrices is called the Cramer method.
III. Cramer’s rule can be applied to the linear systems which consist of two unknowns or more than two unknowns.
What can be said to be true about Cramer's rule?
diagonal is multiplied.
II. The descending diagonals from left to right has negative sign while the descending diagonals from right to left has a positive sign.
III. To obtain the determinant of the matrix, the results of the multiplications are added by taking into account the signs.
What can be said to be true about Sarrus' rule?
II. det(A + B) = detA + detB
III. det(A + B) ≠ detA + detB
Which of the given equalities about the determinant of a matrix can be said to be true?
II. a linear function in two variables that we want to maximize or minimize is called the goal function.
III. The system of linear inequalities in a linear programming problem is also called the Corner Point.
What can be said to be true about linear programming problems?
II. The constraint set is bounded and is called a polygonal set with infinite number of corner points.
III. The corner points of the constraint set are the intersection points of the straight lines.
What can be said to be true in the case of n = 2, the linear programming problem consists of the maximization of linear, two variable function f = ax + by under the system of linear inequalities in two variables?