Is divisible by ?
Notation: is the factorial notation. For example:
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 actually states that if
( n − 1 ) ! + 1 ≡ 0 ( m o d n )
then n is prime. The converse is also true that if n is a prime then ( n − 1 ) ! ≡ − 1 ( m o d n ) .
A common observation tells us that in the problem it is stated 7 7 4 7 ! not 7 7 4 7 and 7 7 4 7 ! > 7 7 4 6 ! + 1 so the division of 7 7 4 6 ! + 1 by 7 7 4 7 ! is certainly not an integer. Furthermore, wilson's theorem has no application here as 7 7 4 7 = 6 1 × 1 2 7 is a composite number.