Related papers: On convolutions of Euler numbers

Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

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…

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 $$…

In this paper we deduce some new supercongruences modulo powers of a prime $p>3$. Let $d\in\{0,1,\ldots,(p-1)/2\}$. We show that $$\sum_{k=0}^{(p-1)/2}\frac{\binom{2k}k\binom{2k}{k+d}}{8^k}\equiv 0\ (\mbox{mod}\ p)\ \ \ \mbox{if}\ d\equiv…

The n-th Delannoy number and the n-th Schr\"oder number given by $D_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}$ and $S_n=\sum_{k=0}^n\binom{n}{k}\binom{n+k}{k}/(k+1)$ respectively arise naturally from enumerative combinatorics. Let p be an…

In this paper we prove three results conjectured by Z.-W. Sun. Let $p$ be an odd prime and let $h\in \mathbb{Z}$ with $2h-1\equiv0\pmod{p^{}}$. For $a\in\mathbb{Z}^{+}$ and $p^a>3$, we show that \begin{align}\notag…

Let p be any odd prime. We mainly show that $$\sum_{k=1}^{p-1}binomial(3k,k)*2^k/k=0 (mod p)$$ and $$\sum_{k=1}^{p-1}2^{k-1}C_k^{(2)}=(-1)^{(p-1)/2}-1 (mod p),$$ where $C_k^{(2)}=binomial(3k,k)/(2k+1)$ is the $k$th Catalan number of order…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Let $p$ be an odd prime, and let $m$ be an integer with $p\nmid m$. In this paper show that $$\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak\binom{-1-a}k}{m^k} \equiv 0\pmod p \quad\hbox{implies}\quad\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom ak…

Let $p>3$ be a prime, and let $a$ be a rational p-adic integer with $a\not\equiv 0\pmod p$. In this paper we establish congruences for $$\sum_{k=1}^{(p-1)/2}\frac{\binom ak\binom{-1-a}k}k, \quad\sum_{k=0}^{(p-1)/2}k\binom ak\binom{-1-a}k…

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

Let $p$ be a sufficiently large prime number, $n$ be a positive odd integer with $n|\,p-1$ and $n>p^\varepsilon $, where $\varepsilon$ is a sufficiently small constant. Let $k(p,\,n)$ denote the least positive integer $k$ such that for…

Let p be a prime and let a be a positive integer. In this paper we determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=1}^{p-1}\binom{2k}{k+d}/(km^{k-1})$ modulo $p$ for all d=0,...,p^a, where m is any integer not divisible by p.…

In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \…

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 prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Let $k>2$ be a prime such that $2^k-1$ is a Mersenne prime. Let $n = 2^{\alpha-1}p$, where $\alpha>1$ and $p<3\cdot 2^{\alpha-1}-1$ is an odd prime. Continuing the work of Cai et al. and Jiang, we prove that $n\ |\ \sigma_k(n)$ if and only…

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

Let $p>3$ be a prime, and let $a$ be a rational p-adic integer. Let $\{B_n(x)\}$ and $\{E_n(x)\}$ denote the Bernoulli polynomials and Euler polynomials, respectively. In this paper we show that $$\sum_{k=0}^{p-1}\binom…