Related papers: Some $q$-congruences involving central $q$-binomia…

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 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}),…

In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…

Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence, which is $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n$-th Bernoulli number. In this paper, we will…

Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper, by using the work of Ishii and Deuring's theorem for elliptic curves with complex multiplication we solve some conjectures of Zhi-Wei Sun concerning…

In this paper we obtain some congruences involving central binomial coefficients and Lucas sequences. For example, we show that if p>5 is a prime then $\sum_{k=0}^{p-1}F_k*binom(2k,k)/12^k$ is congruent to 0,1,-1 modulo p according as p=1,4…

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…

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

Recently the first author proved a congruence proposed in 2006 by Adamchuk: $\sum_{k=1}^{\lfloor\frac{2p}{3}\rfloor}\binom{2k}{k}\equiv 0\pmod{p^2}$ for any prime $p=1 \pmod{3}$. In this paper, we provide more examples (with proofs) of…

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

We first prove that if $a$ has a prime factor not dividing $b$ then there are infinitely many positive integers $n$ such that $\binom {an+bn} {an}$ is not divisible by $bn+1$. This confirms a recent conjecture of Z.-W. Sun. Moreover, we…

We give a $q$-analogue of some binomial coefficient identities of Y. Sun [Electron. J. Combin. 17 (2010), #N20] as follows: {align*} \sum_{k=0}^{\lfloor n/2\rfloor}{m+k\brack k}_{q^2}{m+1\brack n-2k}_{q} q^{n-2k\choose 2} &={m+n\brack…

For any odd prime p we obtain q-analogues of Van Hamme's supercongruence: $$ \sum_{k=0}^{\frac{p-1}{2}}{2k\choose k}^3\frac{1}{64^k} \equiv 0 \pmod{p^2} \quad\text{for}\quad p\equiv 3\pmod 4, $$ and Rodriguez-Villegas' Beukers-like…

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.

Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper we prove some supercongruences concerning $$\align &\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom{3k}k}{54^k},\…

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

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…

By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\sum_{k=0}^l(-1)^{m-k}\binom{l}{k}\binom{m-k}{n}\binom{2k}{k-2l+m} =\sum_{k=0}^l\binom{l}{k}\binom{2k}{n}\binom{n-l}{m+n-3k-l}. On the basis of this…

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…

For coprime positive integers $q$ and $e$, let $m(q,e)$ denote the least positive integer $t$ such that there exists a sum of $t$ powers of $q$ which is divisible by $e$. We prove an upper bound for $m(q.e)$ and investigate the case where…