Question: (4 points) Find the smallest positive integer x that solves the congruence: 13x E4 (mod 94) (Hint: From running the Euclidean algorithm forwards and backwards
(4 points) Find the smallest positive integer x that solves the congruence: 13x E4 (mod 94) (Hint: From running the Euclidean algorithm forwards and backwards we get 1s(13) +94). Find s and use it to solve the congruence.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
