Related papers: Supercongruences for central trinomial coefficient…

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

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

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…

The Delannoy polynomial $D_n(x)$ is defined by $$ D_n(x)=\sum_{k=0}^{n}{n\choose k}{n+k\choose k}x^k. $$ We prove that, if $x$ is an integer and $p$ is a prime not dividing $x(x+1)$, then \begin{align*} \sum_{k=0}^{p-1}(2k+1)D_k(x)^3…

For $n=0,1,2,\ldots$ let $W_n=\sum_{k=0}^{[n/3]}\binom{2k}k \binom{3k}k\binom n{3k}(-3)^{n-3k}$, where $[x]$ is the greatest integer not exceeding $x$. Then $\{W_n\}$ is an Ap\'ery-like sequence. In this paper we deduce many congruences…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Let $p$ be a prime. In this paper, we present a detailed $p$-adic analysis to factorials and double factorials and their congruences. We give good bounds for the $p$-adic sizes of the coefficients of the divided universal Bernoulli number…

Let $p>3$ be a prime, and let $R_p$ be the set of rational numbers whose denominator is coprime to $p$. Let $\{P_n(x)\}$ be the Legendre polynomials. In this paper we mainly show that for $m,n,t\in R_p$ with $m\not\e 0\pmod p$, $$\align…

Define $$D_n(x)=\sum_{k=0}^n\binom nk^2x^k(x+1)^{n-k}\ \ \ \mbox{for}\ n=0,1,2,\ldots$$ and $$s_n(x)=\sum_{k=1}^n\frac1n\binom nk\binom n{k-1}x^{k-1}(x+1)^{n-k}\ \ \ \mbox{for}\ n=1,2,3,\ldots.$$ Then $D_n(1)$ is the $n$-th central Delannoy…

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 we prove the supercongruence $$\sum_{n=0}^{(p-1)/2}\frac{6n+1}{256^n}\binom{2n}n^3\equiv p(-1)^{(p-1)/2}+(-1)^{(p-1)/2}\frac{7}{24}p^4B_{p-3}\pmod{p^5}$$ for any prime $p>3$, which was conjectured by Sun in 2019.

Every binomial coefficient aficionado knows that the greatest common divisor of the binomial coefficients $\binom n1,\binom n2,\dots,\binom n{n-1}$ equals $p$ if $n=p^i$ for some $i>0$ and equals 1 otherwise. It is less well known that the…

In 2017, motivated by a supercongruence conjectured by Kimoto and Wakayama and confirmed by Long, Osburn and Swisher, Z.-W. Sun introduced the sequence of polynomials: $$…

In this paper, we establish congruences (mod $p^2$) involving the quadrinomial coefficients $\dbinom{np-1}{p-1}_{3}$ and $\dbinom{np-1}{\frac{p-1}{2}}_{3}$. This is an analogue of congruences involving the trinomial coefficients…

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

A practical number is a positive integer $n$ such that all positive integers less than $n$ can be written as a sum of distinct divisors of $n$. Leonetti and Sanna proved that, as $x \to +\infty$, the central binomial coefficient…

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}\ \ \…