∑ZWMath CoursesSyllabusExercises
ES
ZWMath›Elementary number theory›Congruences›Wilson's theorem›ZW-WILSON-S-THEOREM-003
Course menu
AreaNumber theoryCourseElementary number theoryTopicCongruences
Divisibility and factorization10
  • Bézout's identity
  • Extended Euclidean algorithm
  • Euclid's lemma
  • Fundamental theorem of arithmetic
  • Least common multiple
  • Infinitude of primes
  • Linear Diophantine equation
  • Greatest common divisor Discrete mathematics
  • Euclidean algorithm Discrete mathematics
  • Prime number Discrete mathematics
Congruences9
  • Complete residue system
  • Modular inverse
  • Linear congruence
  • Chinese remainder theorem
  • Fermat's little theorem
  • Euler's totient function
  • Euler's theorem
  • Wilson's theorem
  • Modular congruence Discrete mathematics
Orders and quadratic residues6
  • Multiplicative order
  • Primitive root
  • Quadratic residue
  • Legendre symbol
  • Euler's criterion
  • Law of quadratic reciprocity
Arithmetic functions5
  • Multiplicative arithmetic function
  • Divisor functions
  • Perfect number
  • Möbius function
  • Möbius inversion formula
Continued fractions and Diophantine equations4
  • Continued fraction
  • Convergent of a continued fraction
  • Pell's equation
  • Sum of two squares
Primes and cryptography3
  • RSA cryptosystem
  • Fermat primality test
  • Prime number theorem

Exercise · ZW-WILSON-S-THEOREM-003 · ★☆☆ Basic

In Wilson's theorem, what condition must \(p\) satisfy?

Choose one option.

Show answer
  • D. Being prime

← Back to the question

Explanation

The result holds only when \(p\) is prime, that is, when its only positive divisors are \(1\) and \(p\).

Study Elementary number theory in ZWMath →

Review the concept: Wilson's theorem

For a prime number \(p\), \((p-1)!\) leaves remainder \(-1\) when divided by \(p\).

\[(p-1)!\equiv -1 \pmod{p}\]

More practice problems: wilson's theorem

  • ZW-WILSON-S-THEOREM-001 What does Wilson's theorem state?
  • ZW-WILSON-S-THEOREM-002 What is the remainder of 4! when divided by 5?
  • ZW-WILSON-S-THEOREM-004 For p = 3, what is 2! modulo 3?
  • ZW-WILSON-S-THEOREM-005 What does (p-1)! ≡ -1 pmodp mean?
  • ZW-WILSON-S-THEOREM-006 If n>1 satisfies (n-1)!≡ -1 pmodn, what can you conclude about n?
  • ZW-WILSON-S-THEOREM-007 Modulo 7, which elements of \1,2,dots,6\ are their own inverses?
  • ZW-WILSON-S-THEOREM-008 What is (p-1)! + 1 modulo p for p = 5?
  • ZW-WILSON-S-THEOREM-009 Knowing that 12! ≡ -1 pmod13, find the remainder of 11! when divided by 13.

← ZW-WILSON-S-THEOREM-002 ZW-WILSON-S-THEOREM-004 →

Practice

⏱Exam simulator10 random questions with a grade☰All exercises
◉Open on course✦Open on free study↗Open on the map

ZWMath · Math from definition to practice. Open the interactive map · Syllabus · All exercises

Author: ORCID iD 0009-0009-8641-3511

Privacy · About Speedrunz · Contact