An incomplete variant of Wilson's congruence

This article examines the nontrivial solutions of the congruence $$(p-1)\cdots(p-r) \equiv -1 \pmod p.$$ We discuss heuristics for the proportion of primes $p$ that have exactly $N$ solutions to this congruence. We supply numerical evidence in favour of these conjectures, and discuss the algorithms used in our calculations.Comment: 7 pages, 2 table

seL4: seL4 3.0.0

View release notes here: https://wiki.sel4.systems/seL4%203.0.

seL4/l4v: Proofs for seL4 3.1.0

Isabelle/HOL proofs for seL4 version 3.1.

seL4/seL4: seL4 5.0.0

See release notes: https://wiki.sel4.systems/seL4%205.0.