In MNLP, NP bisects ∠MNL. Is this enough information to prove that MNLP is a rhombus? Explain.

A. Yes, by Theorem 6−17
B. Yes, because it proves that MNLP is a rectangle, and any rectangle is also a rhombus.
C. No; you also need to know MNLP is a parallelogram and that ∠MNL is supplementary to ∠PMN.
D. No; you also need to know that MNLP is a parallelogram and that NP bisects ∠LPM.

yes

yes yes yes

answer: a video game has three difficulty levels: easy, medium, and expert. the game's scoring works in such a way that a player has to score a fixed number of points to advance to the next level, and then the scoring starts over. the total score needed to clear all three difficulty levels is 7,500. two times the number of points needed to clear the easy level is 500 more than the number of points needed to clear the medium level. twice the number of points needed to clear the medium difficulty level is 1,500 more than the number of points needed to clear the expert level. if x, y, and z represent the easy, medium, and expert levels, respectively, and a is the coefficient matrix of the system of equations modeling this situation, identify the inverse matrix, a-1, and the solution matrix, x, of the system of equations.

ask for details followreport by buttfacelily 2 minutes ago

answers

rauschg

rauschg · hand

know the answer? add it here!

step-by-step explanation:

step-by-step explanation:

graph using a few selected

x         y

-1       15

0         6

1         2.4

2       0.96