Related papers: Super congruences and Euler numbers
In this paper, we prove that for any odd prime $p$ and for any $p$-integer $\alpha $,we have $ \binom{\alpha p-1}{p-1}\equiv 1-\alpha (\alpha -1)(\alpha ^{2}-\alpha -1)p\sum_{k=1}^{p-1}\frac{1}{k}+\alpha ^{2} (\alpha-1)^{2}p^{2}\sum_{1\leq…
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…
We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.
In this paper, we confirm six conjectures on the exact values of some permanents, relating them to the Genocchi numbers of the first and second kinds as well as the Euler numbers. For example, we prove that…
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…
Using an identity arising in the known Banach probability problem on matchboxes, we prove an unexpected congruence for odd prime $p:$ for $1\leq k\leq \frac{p-1}{2},\enskip \sum_{i=1}^{p-2k-1}2^{i-1}\binom{k-1+i}{k}\equiv 0\pmod p.$
Let $\overline{p}_{k}(n)$ denote the number of overpartition $k$-tuples of $n$. In 2023, Saikia \cite{saikia} conjectured the following congruences: \begin{align*} \overline{p}_{q}(8n+2)& \equiv 0 \pmod{4},\quad \overline{p}_{q}(8n+3)\equiv…
For any positive integer $n$ and variables $a$ and $x$ we define the generalized Legendre polynomial $P_n(a,x)=\sum_{k=0}^n\b ak\b{-1-a}k(\frac{1-x}2)^k$. Let $p$ be an odd prime. In the paper we prove many congruences modulo $p^2$ related…
Recently, Z.-W. Sun made the following conjecture: for any odd prime $p$ and odd integer $m$, $$ \frac{1}{m^2{m-1\choose (m-1)/2}}\Bigg(\sum_{k=0}^{(pm-1)/2}\frac{{2k\choose k}}{8^k}…
In $1735$ Euler \cite{1} proved that for each positive integer $k$, the series $\zeta(2k) = \sum_{\ell=1}^{\infty} \ell^{-2k}$ converges to a rational multiple of $\pi^{2k}$. Many demonstrations of this fact are now known, and Euler's…
Let $n$ and $r$ be positive integers. Define the numbers $S_n^{(r)}$ by $S_n^{(r)}=\sum_{k=0}^n\binom{n}{k}^2\binom{2k}{k}(2k+1)^r.$ In this paper we prove some conjectures of Guo and Liu which extend some conjectures of Z.-W. Sun…
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}),…
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 this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…
Let $p\equiv3\pmod{4}$ be a prime and $r$ a positive integer. We show that $$ \prod_{k=1}^{(p^{2r}-1)/2}\frac{4k-1}{4k+1}\equiv1\pmod{p^2}. $$ This confirms a recent conjecture of Guo.
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…
We study different q-analogues and generalizations of the ex-conjectures of Rodriguez-Villegas. For example, for any odd prime p, we show that the known congruence \sum_{k=0}^{p-1}\frac{{2k\choose k}^2}{16^k} \equiv…
For $A,B\in\mathbb Z$, the Lucas sequence $u_n(A,B)\ (n=0,1,2,\ldots)$ are defined by $u_0(A,B)=0$, $u_1(A,B)=1$, and $u_{n+1}(A,B) = Au_n(A,B)-Bu_{n-1}(A,B)$ $(n=1,2,3,\ldots).$ For any odd prime $p$ and positive integer $n$, we establish…
The polynomials $d_n(x)$ are defined by \begin{align*} d_n(x) &= \sum_{k=0}^n{n\choose k}{x\choose k}2^k. \end{align*} We prove that, for any prime $p$, the following congruences hold modulo $p$: \begin{align*}…
For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th…