WILSON THEOREM

Q1) Find the remainder when 97! Is divided by 101

SOL-

Q2) Find the remainder when 2016!−2015! is divided by 2017.

SOL-
Q3) Prove (p−2)!≡1(modp), when p is prime.
SOL-

Q4) Prove that if n is a composite integer greater than 4, then (n−1)!≡0(modn)

SOL-

Q5) Find the remainder upon division by 13 of a, where

1/1+1/2+1/3+⋯+1/23=a/23!
SOL- Put this back into the realm of integers by multiplying by 23!
Q6) For q=(p−1)/2, where p is an odd prime, prove p∣(q!)^2+(−1)^q

Sol-

Q7) Suppose p≡1(mod4), then show there exists an integer where p∣n^2+1

SOL- try yourself :D

Q8) For how many integers between and , inclusive, is an integer?

(Recall that .)
SOL- The main insight is that

is always an integer. This is true because it is precisely the number of ways to split
up objects into unordered groups of size . Thus,

is an integer if , or in other words, if . This condition is false precisely

when or is prime, by Wilson's Theorem. There are primes
between and , inclusive, so there are terms for which
is potentially not an integer. It can be easily verified that the above expression is not an
integer for as there are more factors of in the denominator than the numerator.
Similarly, it can be verified that the above expression is not an integer for any
prime , as there are more factors of p in the denominator than the numerator.
Thus all values of n make the expression not an integer and the answer is 50-16=34