Papers
Topics
Authors
Recent
Search
2000 character limit reached

Wilson Quotient in Number Theory

Updated 10 July 2026
  • Wilson quotient is defined as ((p-1)! + 1)/p for primes, serving as a correction term to Wilson’s theorem and offering insights into p-adic structures.
  • It distinguishes Wilson primes and links to Fermat quotients, Bell numbers, and left factorials, revealing deep arithmetic and combinatorial relationships.
  • Recent studies extend Wilson’s theorem to higher powers using recursive polynomial techniques and divided Bernoulli numbers to achieve supercongruence results.

The Wilson quotient is the integer

Wp=(p−1)!+1p,W_p=\frac{(p-1)!+1}{p},

defined for a prime p≥3p\ge 3. Its integrality is a direct consequence of Wilson’s theorem, and its arithmetic role is to quantify the extent to which the congruence (p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p fails to be an exact identity in Z\mathbb Z. In current work, the Wilson quotient appears simultaneously as a classical invariant of primes, a pp-adic object admitting higher-power refinements, and a node in a wider network of congruences involving left factorials, Bell numbers, Fermat quotients, and generalized Wilson-type quotients (Howard, 8 Apr 2026, Kellner, 5 Sep 2025, Morozov, 22 May 2025).

1. Definition and immediate consequences

For a prime pp, Wilson’s theorem states that

(p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.

A standard proof considers the factorization of xp−1−1x^{p-1}-1 over Z/pZ\mathbb Z/p\mathbb Z:

xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,

and evaluates at p≥3p\ge 30 to obtain p≥3p\ge 31, since p≥3p\ge 32 is even. An equivalent derivation uses the multiplicative group p≥3p\ge 33 (Howard, 8 Apr 2026).

Because p≥3p\ge 34, the quotient

p≥3p\ge 35

lies in p≥3p\ge 36. Equivalently,

p≥3p\ge 37

This makes p≥3p\ge 38 the first-order correction term to Wilson’s congruence in the p≥3p\ge 39-adic direction. The quantity is often studied modulo powers of (p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p0, not only modulo (p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p1 itself, because higher congruence data encode substantially finer information than the classical statement alone (Howard, 8 Apr 2026, Kellner, 30 Oct 2025).

A useful characterization is that

(p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p2

if and only if (p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p3 is a Wilson prime. This is precisely the condition (p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p4 (Howard, 8 Apr 2026).

2. Wilson primes, elementary examples, and residue-level behavior

A prime (p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p5 is called a Wilson prime if

(p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p6

Only three are known:

(p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p7

The associated open problem asks whether there are infinitely many Wilson primes or only finitely many; the data under discussion records that this remains open (Howard, 8 Apr 2026).

For small primes, the quotient is explicit. When (p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p8,

(p−1)!≡−1(modp)(p-1)!\equiv -1\pmod p9

When Z\mathbb Z0,

Z\mathbb Z1

so Z\mathbb Z2 is a Wilson prime. When Z\mathbb Z3,

Z\mathbb Z4

These examples already show that integrality of Z\mathbb Z5 is universal for primes, whereas vanishing modulo Z\mathbb Z6 is exceptional (Howard, 8 Apr 2026).

The residue class of Z\mathbb Z7 modulo Z\mathbb Z8 is also tied to classical congruences of Lerch type. In particular, later higher-power work recovers

Z\mathbb Z9

where

pp0

Thus the mod-pp1 Wilson quotient is expressible as a power sum of Fermat quotients, linking Wilson’s theorem to a separate but closely related arithmetic framework (Kellner, 5 Sep 2025).

3. Left factorials, Bell numbers, and the Kurepa–Bell–Wilson congruence

The Wilson quotient enters a broader combinatorial-arithmetic structure through the left-factorial sequence and the Bell numbers. For odd primes pp2, the left factorial is

pp3

while the Bell numbers pp4 count set partitions and satisfy the exponential generating function

pp5

Gertsch’s congruence asserts that for every odd prime pp6,

pp7

According to the cited account, this follows from combining Touchard’s congruences for Bell polynomials with the congruence pp8 (Howard, 8 Apr 2026).

Within this setting, the paper "The Wilson Quotient, Left Factorials, Bell Numbers, and the Kurepa–Bell–Wilson Congruence" formulates the Kurepa–Bell–Wilson congruence:

pp9

This congruence makes the Wilson quotient an additive component in a decomposition of a normalized left-factorial expression, with the Bell-number term furnishing the complementary component (Howard, 8 Apr 2026).

The same work defines the Gertsch quotient

pp0

From the KBW congruence one obtains

pp1

Hence pp2 is an integer lift of the residue of pp3. The paper further interprets this lift in the “poor man’s adele ring”

pp4

via the natural diagonal embedding of pp5 (Howard, 8 Apr 2026).

The small-prime instances given in the source illustrate the congruence concretely. For pp6, one has pp7 and pp8. For pp9, one has (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.0 and (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.1, hence both are congruent modulo (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.2. For (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.3, one has (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.4 and (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.5, again with

(p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.6

The same source records that no prime (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.7 is known for which (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.8 (Howard, 8 Apr 2026).

4. Supercongruences and higher prime-power expansions

A major contemporary development is the extension of Wilson’s theorem from modulus (p−1)!≡−1(modp).(p-1)!\equiv -1\pmod p.9 to arbitrary higher powers xp−1−1x^{p-1}-10. For an odd prime xp−1−1x^{p-1}-11 with xp−1−1x^{p-1}-12, Kellner proves that there exist unique multivariate polynomials

xp−1−1x^{p-1}-13

each with no constant term, such that

xp−1−1x^{p-1}-14

and equivalently

xp−1−1x^{p-1}-15

For xp−1−1x^{p-1}-16 this reproduces Lerch’s congruence

xp−1−1x^{p-1}-17

(Kellner, 5 Sep 2025).

The construction uses partial Bell polynomials and Newton’s identities. The elementary symmetric sums of the family xp−1−1x^{p-1}-18 are rewritten in terms of the power sums xp−1−1x^{p-1}-19, and the key factorization

Z/pZ\mathbb Z/p\mathbb Z0

then ties the resulting symmetric-polynomial data to powers of Z/pZ\mathbb Z/p\mathbb Z1. The recursion for the Z/pZ\mathbb Z/p\mathbb Z2 is uniform in Z/pZ\mathbb Z/p\mathbb Z3, and the low-degree cases are explicitly

Z/pZ\mathbb Z/p\mathbb Z4

Z/pZ\mathbb Z/p\mathbb Z5

(Kellner, 5 Sep 2025).

A further refinement computes the Wilson quotient modulo Z/pZ\mathbb Z/p\mathbb Z6 and Z/pZ\mathbb Z/p\mathbb Z7, and equivalently Z/pZ\mathbb Z/p\mathbb Z8 modulo Z/pZ\mathbb Z/p\mathbb Z9 and xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,0, respectively. In that framework one introduces the divided Bernoulli numbers

xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,1

which lie in xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,2 and satisfy the usual Kummer congruences. For xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,3,

xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,4

and for xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,5,

xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,6

The coefficients xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,7 admit closed forms in the divided Bernoulli numbers; for instance,

xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,8

in the modulus-xp−1−1≡(x−1)(x−2)⋯(x−(p−1))(modp),x^{p-1}-1\equiv (x-1)(x-2)\cdots(x-(p-1))\pmod p,9 theorem (Kellner, 30 Oct 2025).

The higher-power study also records a regular pattern in the reductions p≥3p\ge 300: the subsequence of pure powers p≥3p\ge 301 appears, along with analogous universal terms in p≥3p\ge 302 and p≥3p\ge 303. The paper formulates the conjectural regularity that for all p≥3p\ge 304, the reduction p≥3p\ge 305 is a p≥3p\ge 306-linear combination of monomials

p≥3p\ge 307

with rational coefficients depending only on p≥3p\ge 308 (Kellner, 30 Oct 2025).

5. Generalized Wilson-type quotients

The ordinary Wilson quotient is the first member of a larger family arising from an extended corollary of Wilson’s theorem. For any integer p≥3p\ge 309 and any integer p≥3p\ge 310 with p≥3p\ge 311,

p≥3p\ge 312

When p≥3p\ge 313, this recovers Wilson’s theorem (Morozov, 22 May 2025).

For a prime p≥3p\ge 314, Morozov defines

p≥3p\ge 315

The case p≥3p\ge 316 is exactly the Wilson quotient:

p≥3p\ge 317

Thus the classical quotient sits inside a finite family of quotients indexed by the position of the factorial split (Morozov, 22 May 2025).

This family satisfies closed-form summation identities. For

p≥3p\ge 318

one has

p≥3p\ge 319

At the residue level, Morozov proves Lehmer-type congruences:

p≥3p\ge 320

where p≥3p\ge 321 are Bernoulli numbers and p≥3p\ge 322 are harmonic numbers. The paper also gives the p≥3p\ge 323-level congruence

p≥3p\ge 324

for the related notation p≥3p\ge 325 (Morozov, 22 May 2025).

The sequence additionally admits an exponential generating function. For fixed p≥3p\ge 326,

p≥3p\ge 327

and

p≥3p\ge 328

Since p≥3p\ge 329, the same EGF describes the sequence p≥3p\ge 330 (Morozov, 22 May 2025).

6. Open questions and conceptual significance

The classical open problem concerns Wilson primes: whether the condition p≥3p\ge 331 is satisfied for infinitely many primes, or only finitely many. The available data record only the three known examples p≥3p\ge 332 (Howard, 8 Apr 2026).

A parallel question arises from the Gertsch quotient. Since

p≥3p\ge 333

one may ask whether there exist primes p≥3p\ge 334 with p≥3p\ge 335. The cited source states that no such prime is known, and that a search up to large bounds has turned up no example. A plausible implication is that the Bell-factorial lift encoded by p≥3p\ge 336 is at least as sparse in its vanishing behavior as the ordinary Wilson quotient, though the data stop short of a structural explanation (Howard, 8 Apr 2026).

The higher-power theory indicates that the Wilson quotient is not merely a residue-level invariant but part of a full p≥3p\ge 337-adic expansion controlled by recursively computable polynomials in Fermat-quotient power sums and, at deeper levels, by divided Bernoulli data (Kellner, 5 Sep 2025, Kellner, 30 Oct 2025). This suggests that Wilson’s theorem fits naturally into a supercongruence framework alongside Bell polynomials, Newton identities, and Kummer-type congruences.

From the conceptual viewpoint emphasized in the KBW setting, the quantity p≥3p\ge 338 in p≥3p\ge 339 decomposes into a Bell-part and a Wilson-part. The source explicitly notes that the interplay among p≥3p\ge 340, p≥3p\ge 341, and p≥3p\ge 342 suggests new analogues of Euler’s constant and multiple-zeta-value phenomena in the finite-modulus setting, and asks how this decomposition extends to higher factorial sums or other combinatorial sequences (Howard, 8 Apr 2026). Within that perspective, the Wilson quotient functions simultaneously as a classical correction term, a modular residue, a p≥3p\ge 343-adic coefficient, and a bridge between factorial arithmetic and combinatorial enumeration.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Wilson Quotient.