(n, p)
| 38 | |
| 39 | |
| 40 | def factorial_modP_Wilson(n, p): |
| 41 | if (p <= n): |
| 42 | return 0 |
| 43 | res = (p - 1) |
| 44 | for i in range(n + 1, p): |
| 45 | res = (res * cached_fn(InverseEuler, i, p)) % p |
| 46 | return res |
| 47 | |
| 48 | |
| 49 | def binary(n, digits=20): |
nothing calls this directly
no test coverage detected