Papers
Topics
Authors
Recent
Search
2000 character limit reached

Wilson's theorem modulo higher prime powers III: The cases modulo p6p^6 and p7p^7

Published 30 Oct 2025 in math.NT | (2510.26743v1)

Abstract: Extending previous work of the author, we compute the Wilson quotient modulo p<sup>5p<sup>5 and p<sup>6p<sup>6, and equivalently (p−1)!(p-1)! modulo p<sup>6p<sup>6 and p<sup>7p<sup>7, respectively. Further, we determine some power sums of the Fermat quotients up to modulo p<sup>6p<sup>6. Subsequently, we discuss some patterns that occur in the pp-adic coefficients of the Wilson quotient as well as of (p−1)!(p-1)!, whereby the original congruence (p−1)!≡−1(modp)(p-1)! \equiv -1 \pmod{p} fits perfectly into the theory.

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.