Browse · MATH
Printjmc
number theory intermediate
Problem
What is the smallest positive integer that satisfies the congruence ?
Solution
Note that 6 divides both and , and since 6 is relatively prime to 47, we can write . Note that , so 19 is the modular inverse of 5, modulo 47. We multiply both sides of the given congruence by 19 to obtain .
Final answer
39