∑
TestPrep
Magic
Features
Entrance Test
Puzzles
Videos
Practice
Download Free
Features
Entrance Test
Puzzles
Videos
Practice
Download Free
← Back to Test
Problem 8 - Entrance Test
Let p be a prime. How many primes p ≤ 50 satisfy p divides (p−1)!+1?
A. 15
B. 16
C. 17
D. 18
Check Answer
Show Solution
Correct: A
By Wilson’s theorem, (p−1)!≡−1 (mod p) for all primes p. Thus (p−1)!+1≡0 (mod p) for every prime. There are 15 primes ≤ 50.