(a) Find the inverse of 19 modulo 141, using the Extended Euclidean Algorithm. Show your steps. (b) Solve the congruence 19x ≡ 7 (mod 141), by specifying all the integer solutions x that satisfy the congruence. ≡
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
(a) Let us find the inverse of 19 modulo 141, using the Extended Euclidean Algorithm. Since
we get that
Therefore, and hence
We conclude that 52 is the inverse of 19 modulo 141.
(b) Let us solve the congruence 19x ≡ 7 (mod 141),
Taking into account that we conclude that and thus
We conclude that the solution is of the form
where