ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime, let N≥0N \geq 0, and consider the congruence referred to in the paper as

. Count its nontrivial solutions in the variable $r$. **Wilson congruence solution-count distribution conjecture.** The proportion of primes $p$ for which

has exactly NN nontrivial solutions is

e−3/42N+1(32∑k=0⌊N/2⌋1k!(N−2k)!+∑k=0⌊(N−1)/2⌋1k!(N−1−2k)!).\frac{e^{-3/4}}{2^{N+1}} \left( \frac{3}{2} \sum_{k=0}^{\lfloor N/2 \rfloor} \frac{1}{k! (N-2k)!} + \sum_{k=0}^{\lfloor (N-1)/2 \rfloor} \frac{1}{k! (N-1-2k)!}\right).

This refined conjecture comes from the same heuristic model as the paper's main zero-solution conjecture. Its status is not resolved in the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.