Answer:
False
Step-by-step explanation:
Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.
A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.
Quotient and/or Remainder = 
Answer:
1) Slope of the line 
2)Slope of the line m = 2
3) slope of the line m = -5
Step-by-step explanation:
<u><em>Step(i):-</em></u>
Given that equation of the straight line 3 x+2 y =0
The slope - intercept form y = mx +c
2 y = - 3x
Slope of the line 
<u><em>Step(ii):-</em></u>
Given that equation of the straight line 2 x- y = 3
The slope - intercept form y = mx +c
y = 2x -3
slope of the line m = 2
<u><em>Step(iii):-</em></u>
Given that equation of the straight line 5 x + y = 10
The slope - intercept form y = mx +c
y = -5x +10
slope of the line m = -5
Answer:
\frac{1}{2} \left[\begin{array}{ccc}16&6&2\\20&8&2\\7&3&1\end{array}\right]
Step-by-step explanation:
Given is a matrix 3x3 as
![\left[\begin{array}{ccc}1&0&2\\-3&1&4\\2&-3&4\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%260%262%5C%5C-3%261%264%5C%5C2%26-3%264%5Cend%7Barray%7D%5Cright%5D)
|A| =2 hence inverse exists.
Cofactors are 16 20 7
6 8 3
2 2 1
Hence inverse =
![\frac{1}{2} \left[\begin{array}{ccc}16&6&2\\20&8&2\\7&3&1\end{array}\right]](https://tex.z-dn.net/?f=%5Cfrac%7B1%7D%7B2%7D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D16%266%262%5C%5C20%268%262%5C%5C7%263%261%5Cend%7Barray%7D%5Cright%5D)
Answer:rtyuiop
Step-by-step explanation: