Related papers: Multiple harmonic sums and Wolstenholme's theorem

Let $p$ be an odd prime and let $x$ be a $p$-adic integer. In this paper, we establish supercongruences for $$ \sum_{k=0}^{p-1}\frac{\binom{x}{k}\binom{x+k}{k}(-4)^k}{(dk+1)\binom{2k}{k}}\pmod{p^2} $$ and $$…

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…

In this paper, we confirm some congruences conjectured by V.J.W. Guo and M.J. Schlosser recently. For example, we show that for primes $p>3$, $$…

Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…

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…

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…

The harmonic number $H_k=\sum_{j=1}^k1/j(k=1,2,3\cdots)$ play an important role in mathematics. Let $p>3$ be a prime. In this paper, we establish a number of congruences with the form $\sum_{k=1}^{p-1}k^mH_k^n(\mod p^2)$ for…

Let $p$ be an odd prime. In 2008 E. Mortenson proved van Hamme's following conjecture: $$\sum_{k=0}^{(p-1)/2}(4k+1)\binom{-1/2}k^3\equiv (-1)^{(p-1)/2}p\pmod{p^3}.$$ In this paper we show further that…

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} (\bmod p^{r}),…

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equiv\l(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol,…

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$…

We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are…

We present some congruences modulo $p^{6-d}$ for sums of the type $\sum_{k=0}^{(p-3)/2}x^k{2k\choose k}/(2k+1)^d$, for $d=1,2,3$ where $p>5$ is a prime.

In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} Z(p^{r})\equiv-2p^{r-1}B_{p-3} ~(\bmod ~ p^{r}), \end{equation*} where $…

It is known that $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)4^k)=\pi/2$ and $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)16^k)=\pi/3$. In this paper we obtain their p-adic analogues such as…

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…

It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for…