This article examines the nontrivial solutions of the congruence (p−1)⋯(p−r)≡−1(modp). 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