Skip to main content
1 of 3
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Is there a polynomial version of Wilson's theorem?

Wilson's theorem states that a natural number $n > 1$ is a prime number if and only if the product of all the positive integers less than $n$ is one less than a multiple of $n$.

Is there a version of the theorem in $\mathbb Z/p\mathbb Z[t]$ where $p$ is a prime?

Are there any other non-trivial versions?

Turbo
  • 13.9k
  • 1
  • 27
  • 76