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.
From Wilson theorem we can have following 1 0 0 0 0 0 2 ! ≡ − 1 m o d ( 1 0 0 0 0 0 3 ) and ( − 6 ) × 9 9 9 9 9 9 ! ≡ − 1 m o d ( 1 0 0 0 0 0 3 ) Now we wish to find the modulo inverse of 6 m o d ( 1 0 0 0 0 0 3 ) . Since 1 0 0 0 0 0 3 = 6 ( 1 6 6 6 6 7 ) + 1 Therefore, 9 9 9 9 9 9 ! ≡ − 1 6 6 6 6 7 m o d ( 1 0 0 0 0 0 3 ) ⟹ 9 9 9 9 9 9 ! ≡ 8 3 3 3 3 6 m o d ( 1 0 0 0 0 0 3 ) So, 8 3 3 3 3 6 is the required answer.