Quadrilateral RSTU has vertices at RS T  ( 1,11) , (9,12) , (13, 5)     and U (2, 2)  . (a) Show that the diagonals of RSTU are perpendicular.

(b) Show that RS ST  .

(c) Given that RSTU is a quadrilateral with perpendicular

diagonals and two adjacent, congruent sides, why isn't RSTU a

rhombus?

solution:

→c= a b , that is product of a and b is possible only when when a is m × n matrix and b is n × p matrix.

that is, number of columns of a= number of rows of b.

so, size of matrix , c= a b is , if a = (m × n)matrix

b= (n × p)matrix

then a b = [ (m × n)matrix] ×[   (n × p)matrix ]

→→c= a b= [m × p ] matrix

→→size of product a b will be equal to = number of rows of a × number of columns of b

step-by-step explanation:

i think something is missing in your question because y-1=(x-12) would not pass through the point (-4,-3). because if you replace x by -4 your are supposed to find y=-3 which is not the case her. if you replace x by -4 you find =-15.

i assume the right equation is y-1=1/4*(x-12) because this one is passing through both your points (if you are interested to know how i found that out i can tell you).

in this equation if i replace x by -4 i find y=-3 and if i replace x by 12, i find y=1 so the line representing this equation is passing through those 2 points.

then the standard form of the equation is finding an expression of y in function of x

y-1=1/4*(x-12)

y=x/4-3+1

y=x/4-2

hope that .

do you confirm there was a mistake in the question?

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

when the daily mileage is greater than 40 miles, unlimited mileage plan will save you money. 40 miles is the break-even point.

step-by-step explanation: