Browse · MATH
Printjmc
number theory senior
Problem
There are four distinct positive integers less than which are invertible modulo . Find the remainder when is divided by .
Solution
First we note that the four integers are . Then we expand to get Finally, we see that (amazingly) each of the four numbers is its own inverse modulo . Thus,
Final answer
0