wilson_theorem_test
Test if an integer is prime using Wilson's theorem: (n-1)! ≡ -1 (mod n) for prime numbers. Enter an integer to verify its primality.
Instructions
Test primality using Wilson's theorem: (n-1)! ≡ -1 (mod n) iff n is prime. (Domain: arithmetic, Category: wilson_theorem)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |