Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory intermediate

Problem

Find the modular inverse of , modulo .

Express your answer as an integer from to , inclusive.
Solution
We are looking for an integer such that is congruent to 1 modulo 28. In other words, we want to solve We subtract from the left-hand side to obtain . This congruence is equivalent to the previous one since is a multiple of 28. Next we multiply both sides by to obtain . Thus is the modular inverse of 27 (mod 28). (Note that since , we always have that is its own inverse modulo .)
Final answer
27