A and B are n×n matrices. Check the true statements below: A. The determinant of A is the product of the pivots in any echelon form U of A, multiplied by (−1)r, where r is the number of row interchanges made during row reduction from A to U. B. det(A+B)=detA+detB. C. If the columns of A are linearly dependent, then detA=0. D. Adding a multiple of one row to another does not affect the determinant of a matrix.

step-by-step explanation:

∆abc has the points a(1, 7), b(-2, 2), and c(4, 2) as its vertices. formed with the point d(1, 2) as its third vertex, then ∆abd is triangle.

start with a line segment pq that we will copy. mark a point r that will be one endpoint of the new line segment. set the compasses' point on the point p of the line segment to be copied. adjust the compasses' width to the point q. the compasses' width is now equal to the length of the line segment pq.

step-by-step explanation:

on monday rodney ate 1/4th of the sandwich = 3/12

on tuesday he ate 1/3rd of the sandwich = 4/12

therefore in total he has eaten = 3/12 + 4/12 = 7/12

thus we can say that he has eaten 7/12 of the sandwich on monday and tuesday alltogether.

happy to

pls mark as brainliest.

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol