Since the original Part 2 was the same problem posted by another member, I've come up with a new problem.
Find the remainder when is divided by
is a prime number. The one.
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.
Wilson's Theorem
Since that 7 9 1 9 is a prime number (you can write a C program to check this),
7 9 1 8 ! ≡ − 1 ( m o d 7 9 1 9 )
7 9 1 8 ⋅ 7 9 1 7 ! ≡ − 1 ( m o d 7 9 1 9 )
7 9 1 8 ⋅ 7 9 1 7 ! ≡ 7 9 1 8 ( m o d 7 9 1 9 )
7 9 1 7 ! ≡ 1 ( m o d ( 7 9 1 8 , 7 9 1 9 ) 7 9 1 9 )
7 9 1 7 ! ≡ 1 ( m o d 7 9 1 9 )
1 . FA, Final Answer.