wilson_theorem_check
Check if a number is prime using Wilson's theorem by verifying if (p-1)! ≡ -1 (mod p). This primality test tool determines prime status mathematically.
Instructions
Check Wilson's theorem: p is prime iff (p-1)! ≡ -1 (mod p). (Domain: arithmetic, Category: primality_tests)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| n | Yes |