Suppose and are inverses of each other modulo . Let and be the smallest positive integers such that (mod ) and (mod ) for all positive integers other than 1. Then
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.
− a ( a + 1 ) ≡ 1 (mod d )
− a 2 − a ≡ 1 (mod d )
a 2 + a ≡ − 1 (mod d )
a ≡ 1 (mod d ) only works for certain values of d . If a 2 ≡ 1 (mod d ), then a ≡ − 1 (mod d ) which is true only if d = 1 . We claim that a 3 ≡ 1 (mod d ) for all positive integers d .
a 3 = a 2 + 1 = a 2 ⋅ a ≡ ( − a − 1 ) ⋅ a ≡ − a ( a + 1 ) ≡ 1 (mod d )
Indeed, r = 3 . We also find that:
a + 1 ≡ − a (mod d ).
( a + 1 ) 3 ≡ ( − a ) 3 (mod d )
( a + 1 ) 3 ≡ − a 3 (mod d )
( a + 1 ) 3 ≡ − 1 (mod d )
( a + 1 ) 3 × 2 ≡ ( − 1 ) 2 (mod d )
( a + 1 ) 6 ≡ 1 (mod d )
Indeed, s = 6 . Therefore, r × s = 3 × 6 = 1 8 .