An incomplete variant of Wilson's congruence
Abstract
This article examines the nontrivial solutions of the congruence \[ (p-1)·s(p-r) -1 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.