Note iis is a mu part queesnon once an answer is supmitea, you wl de unnadie to rerum to nis part arrange the steps in the correct order to find an inverse of a modulo m for each of the following pairs of relatively prime integers using the euclidean algorithm. a 19, m 141 rank the options below the gcd in terms of 141 and 19 is written as 1-3-1-2 =3-1- (8-2-3) 3.3-1-8 =3. (19-2-8)-1.8- 3 19-7 8 3- 19-7 (141-7-19) (-7 ) 141 52 19 the steps to find gcd(19, 141) using the euclidean algorithm are listed below. 141 7-19 +8 19 2 8+3 8 2.3+2 3=1-2+1 2 2-1 the bézout coefficients of 19 and 141 are 52 and -7, respectively 52 is an inverse of 19 modulo 141

- both graphs increase on their domain.

- the graphs of both functions have the same x-intercept.

- neither graph has a y-intercept.

answer: 4 (:

step-by-step explanation:

the area of the rectangle is 35units^2.

step-by-step explanation:

graph it and find the distance.

it is a 5*7 rectangle.

therefore the area is 35units^2.

answer: (-8,4) are the coordinates of a

step-by-step explanation:

let the side of square abcd is x .

thus the area of square abcd is .

now, by the diagram area of triangle ead= 1/2 × ea × ad = 1/2 × ea × x

( because ad is the side of square)

and, according to the question,

the areas of square abcd and right ead are equal.

⇒

⇒ea=2x

thus, ea: ab=2: 1

therefore, point a divides line segment eb into the ratio 2: 1.

⇒ by sectional formula coordinates of a are,

=

=

=(-8, 4)

thus the coordinates of a are (-8,4)