Practice30 Create account

By Wilson's theorem, what remainder does 16! leave when divided by 17?

Competition practiceNumber System, HCF & LCM

A16
B1
C0
D8

Step-by-Step Solution

For a prime

p, (p - 1)! \equiv - 1 (mod p)

. So

16! \equiv - 1 \equiv 16 (mod 17)

. (It is not 0, because 17 is prime and does not appear among the factors.)

Answer: A) 16

Master this topic in 30 minutes a day.

Don't just memorise the answer — build a daily practice habit.

Practice 5 Similar Questions Free →

All Number System, HCF & LCM practice questions

More Number System, HCF & LCM practice

How many digits are used in all to number the pages of a book that has 250 pages?Exactly 1890 digits are used to number the pages of a book. How many pages does it have?What is the smallest number by which 588 must be multiplied so that the product is a…N = 10^25 - 7. What is the sum of the digits of N?How many of the numbers from 1 to 1000 are divisible by none of 2, 3 and 5?