Related papers: Proof of a conjecture of Adamchuk
In this paper, we prove two supercongruences conjectured by Z.-W. Sun via the Wilf-Zeilberger method. One of them is, for any prime $p>3$, \begin{align*} \sum_{n=0}^{p-1}\frac{6n+1}{256^n}\binom{2n}n^3&\equiv…
A prime number $p$ is said to be a Wolstenholme prime if it satisfies the congruence ${2p-1\choose p-1} \equiv 1 \,\,(\bmod{\,\,p^4})$. For such a prime $p$, we establish the expression for ${2p-1\choose p-1}\,\,(\bmod{\,\,p^8})$ given in…
In this paper, we mainly prove two conjectural supercongruences of Sun by using the following identity $$ \sum_{k=0}^n\binom{2k}{k}^2\binom{2n-2k}{n-k}^2=16^n\sum_{k=0}^n\frac{\binom{n+k}{k}\binom{n}{k}\binom{2k}{k}^2}{(-16)^k} $$ which…
In recent years, the congruence $$ \sum_{\substack{i+j+k=p\\ i,j,k>0}} \frac1{ijk} \equiv -2 B_{p-3} \pmod{p}, $$ first discovered by the last author have been generalized by either increasing the number of indices and considering the…
Let $p$ be a prime and ${\mathcal{P}_{p}}$ the set of positive integers which are prime to $p$. We establish the following interesting congruence \[\sum\limits_{\begin{smallmatrix} i+j+k={{p}^{r}} i,j,k\in {\mathcal{P}_{p}}…
Let the numbers $\alpha_n,\beta_n$ and $\gamma_n$ denote \begin{align*} \alpha_n=\sum_{k=0}^{n-1}{2k\choose k},\quad \beta_n=\sum_{k=0}^{n-1}{2k\choose k}\frac{1}{k+1}\quad\text{and}\quad \gamma_n=\sum_{k=0}^{n-1}{2k\choose…
In this paper, we confirm several conjectures posed by Sun recently; for example, we prove that for any odd prime $p$ we have $$ \sum_{k=0}^{p-1}A_k\equiv\begin{cases}4x^2-2p\pmod{p^2}\quad&\text{if $p=x^2+2y^2\ (x,y\in\mathbb{Z})$},\\…
Let $ p \ge 5 $ be a prime and let $ b, c \in \mathbb{Z} $. Denote by $ T_k(b,c) $ the generalized central trinomial coefficient, i.e., the coefficient of $ x^k $ in $ (x^2 + bx + c)^k $. In this paper, we establish congruences modulo $ p^3…
Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…
Let $p>3$ be a prime, and let $q_p(2)=(2^{p-1}-1)/p$ be the Fermat quotient of $p$ to base 2. Recently, Z. H. Sun proved that \sum_{k=1}^{p-1}\frac{1}{k\cdot 2^k}\equiv q_p(2)-\frac{p}{2}q_p(2)^2 \pmod{p^2} which is a generalization of a…
Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…
Let $m$ and $n>0$ be integers. Suppose that $p$ is a prime dividing $m-4$ but not dividing $m$. We show that $\nu_p(\sum_{k=0}^{n-1}\frac{\binom{2k}k}{m^k})$ and $\nu_p(\sum_{k=0}^{n-1}\binom{n-1}{k}(-1)^k\frac{\binom{2k}k}{m^k})$ are at…
In this paper, we prove the following result conjectured by Z.-W. Sun: $$ (2n-1){3n\choose n}| \sum_{k=0}^{n}{6k\choose 3k}{3k\choose k}{6(n-k)\choose 3(n-k)}{3(n-k)\choose n-k}. $$ by showing that the left-hand side divides each summand on…
In the recent article arXiv:1606.03351, Apagodu and Zeilberger discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the end they…
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}}…
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…
We give a $q$-congruence whose specializations $q=-1$ and $q=1$ correspond to supercongruences (B.2) and (H.2) on Van Hamme's 1997 list: $$ \sum_{k=0}^{(p-1)/2}(-1)^k(4k+1)A_k\equiv p(-1)^{(p-1)/2}\pmod{p^3} \quad\text{and}\quad…
Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…
We prove that if $q$ is a power of a prime $p$ and $p^k$ divides $a$, with $k\ge 0$, then \[ 1+(q-1)\sum_{0\le b(q-1)<a} \binom{a}{b(q-1)}\equiv 0\pmod{p^{k+1}}. \] The special case of this congruence where $q=p$ was proved by Carlitz in…
In 2003, Zhao discovered a curious congruence involving harmonic series and Bernoulli numbers: for any odd prime $p$, $$\sum_{\substack{i,j,k\ge 1\\\gcd(ijk,p)=1\\i+j+k=p}}\frac{1}{ijk}\equiv -2B_{p-3} \pmod{p},$$ where $B_n$ is the $n$-th…