Let and let Find the smallest positive integer such that is the multiplicative inverse of
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Notice that 7 B = 9 9 9 , 9 9 9 ≡ − 1 ( m o d 1 , 0 0 0 , 0 0 0 ) . Thus, by modular arithmetic,
1 1 1 , 1 1 1 9 9 9 , 9 9 9 × 7 B
is what we desire.
The expression turns out to cancel nicely, and we are left with
6 3 .