Solution to (a) Find the inverse of 19 modulo 141, using the Extended Euclidean Algorithm. Show your … - Sikademy
Author Image

Archangel Macsika

(a) Find the inverse of 19 modulo 141, using the Extended Euclidean Algorithm. Show your steps.

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

Euclidean Algorithm:

141=7\cdot 19+8

19=2\cdot 8+3

8=2\cdot 3+2

3=1\cdot 2+1


We have:

1= \mathbf{3}-\mathbf{2} \\ \ \ \ = \mathbf{3}-(\mathbf{8}-2\cdot \mathbf{3)} \\ \ \ \ =3\cdot \mathbf{3}-\mathbf{8} \\ \ \ \ =3\cdot (\mathbf{19}-2\cdot \mathbf{8})-\mathbf{8} \\ \ \ \ =3\cdot \mathbf{19}-7\cdot \mathbf{8} \\ \ \ \ =3\cdot \mathbf{19}-7\cdot (\mathbf{141}-7\cdot \mathbf{19}) \\ \ \ \ =52\cdot \mathbf{19}-7\cdot \mathbf{141}


1=52\cdot 19-7\cdot 141\equiv 52\cdot 19\mod 141


Answer: 52 .


Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-1211-qpid-949