Papers
Topics
Authors
Recent
Search
2000 character limit reached

Wilson's theorem modulo higher prime powers II: Bernoulli numbers and polynomials

Published 5 Sep 2025 in math.NT | (2509.05402v1)

Abstract: By recent work of the author, Wilson's theorem as well as the Wilson quotient can be described by supercongruences of power sums of Fermat quotients modulo every higher prime power. We translate these congruences into congruences of power sums and Bernoulli numbers. This together provides relatively short proofs of the congruences compared to former approaches. As an application, we compute, e.g., the Wilson quotient up to (modp<sup>4)\pmod{p<sup>4} and equivalently the factorial (p−1)!(p-1)! up to (modp<sup>5)\pmod{p<sup>5}, which can be extended to any higher prime power with some effort. As a by-product, we determine some power sums of the Fermat quotients up to (modp<sup>4)\pmod{p<sup>4}.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

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

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.