wilson_factorial_mod
Calculate k! mod m efficiently for Wilson's theorem primality testing. Computes factorial modulo for number theory applications.
Instructions
Calculate k! mod m efficiently for Wilson's theorem. (Domain: arithmetic, Category: primality_tests)
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| k | Yes | ||
| m | Yes |