Related papers: Wilson's theorem modulo p^2 derived from Faulhaber…

In 1862 Wolstenholme proved that for any prime $p\ge 5$ the numerator of the fraction $$ 1+\frac 12 +\frac 13+...+\frac{1}{p-1} $$ written in reduced form is divisible by $p^2$, $(2)$ and the numerator of the fraction $$ 1+\frac{1}{2^2}…

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A…

We prove a recent conjecture due to Deutsch, Sagan, and Wilson stating that the finite sequence obtained from the first p central trinomial coefficients modulo p by replacing nonzero terms by 1's is palindromic, for any prime number p > 3.…

In this paper, using $p$-adic analysis and $p$-adic L-functions, we show how to extend classical congruences (due to Wilson, Gauss, Dirichlet, Jacobi, Wolstenholme, Glaisher, Morley, Lemher and other people) to modulo $p^k$ for any $k>0$.

We show that, modulo some odd prime p, the powers of two weighted sum of the first p-2 divided Bernoulli numbers equals the Agoh-Giuga quotient plus twice the number of permutations on p-2 letters with an even number of ascents and distinct…

We show that there are four possibilities for the product of all elements in the multiplicative group of a quotient of the ring of integers in a number field, and give precise conditions for each of the possibilities to occur. This…

We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

The basis of this work is a simple, extended corollary of Wilson's theorem. This corollary generates many more quotients than those already generated by Wilson's theorem, and it was of interest to derive how they relate to each other and…

Several new estimates for the 2-adic valuations of Stirling numbers of the second kind are proved. These estimates, together with criteria for when they are sharp, lead to improvements in several known theorems and their proofs, as well as…

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…

Given a prime $p\geq 5$, we reduce modulo p a convolution of order p-1 of powers of two weighted Bernoulli numbers with Bernoulli numbers in terms of harmonic numbers and generalized harmonic numbers. Our proof is based on studying the…

We prove a series of Stephan's conjectures concerning Pascal triangle modulo 2 and give a polynomial generalization.

We provide a proof of Wilson's Theorem and Wolstenholme's Theorem based on a direct approach by Lagrange requiring only basic properties of the primes and the Binomial theorem. The goal is to show how similar the two theorems are by…

In this note we consider the theorem established in arXiv:1912.07171 concerning the sums of powers of the first $n$ positive integers, $S_k = 1^k + 2^k + \cdots + n^k$, and show that it can be used to demonstrate the classical theorem of…

In this short note, we introduce an Euler analogue of Wilson's theorem; $a_1a_2... a_{\phi(n)}\equiv (-1)^{\phi(n)+1}~({\rm mod}~n)$ say, where ${\rm gcd}(a_i,n)=1$.

A classical result of A. Fleck states that if p is a prime, and n>0 and r are integers, then $$\sum_{k=r(mod p)}\binom {n}{k}(-1)^k=0 (mod p^{[(n-1)/(p-1)]}).$$ Recently R. M. Wilson used Fleck's congruence and Weisman's extension to…

Let $S_p(n)$ denote the sum of $p$th powers of the first $n$ positive integers $1^p + 2^p + \cdots + n^p$. In this paper, first we express $S_p(n)$ in the so-called Faulhaber form, namely, as an even or odd polynomial in $(n + 1/2)$,…

Let $p$ be an odd prime, and let $\sum_{n=0}^{\infty} a_{n}X^{n}\in\mathbb{F}_p[[X]]$ be the reduction modulo $p$ of the Artin-Hasse exponential. We obtain a polynomial expression for $a_{kp}$ in terms of those $a_{rp}$ with $r<k$, for even…