Section V.5

§ 5

[2/100%]
Show
LaTeX
Problem V.5.1

Let the numbers x1,x2,x3x_{1}, x_{2}, x_{3} be pairwise distinct. Prove that for any y1,y2,y3y_{1}, y_{2}, y_{3} there exists a unique polynomial of degree ⩽2\leqslant 2, whose graph passes through the points with coordinates (x1,y1),(x2,y2),(x3,y3)\left(x_{1}, y_{1}\right),\left(x_{2}, y_{2}\right),\left(x_{3}, y_{3}\right).

?
Problem V.5.2

Using the formulas for the entries of the inverse matrix, find the inverse of the matrix

∥abcd∥. \left\| \begin{array}{ll} a & b \\ c & d \end{array}\right\| .
?