Related papers: Congruences for sums involving $\binom{rk}{k}$

The Ap\'ery polynomials are given by $$A_n(x)=\sum_{k=0}^n\binom nk^2\binom{n+k}k^2x^k\ \ (n=0,1,2,\ldots).$$ (Those $A_n=A_n(1)$ are Ap\'ery numbers.) Let $p$ be an odd prime. We show that…

Let $p$ be a prime and let $x$ be a $p$-adic integer. We provide two supercongruences for truncated series of the form $$\sum_{k=1}^{p-1} \frac{(x)_k}{(1)_k}\cdot \frac{1}{k}\sum_{1\le j_1\le\cdots\le j_r\le k}\frac{1}{j_1^{}\cdots…

We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke,…

In this paper we mainly employ the Zeilberger algorithm to study congruences for sums of terms involving products of three binomial coefficients. Let $p>3$ be a prime. We prove that…

In this paper, we investigate the stabilizers of certain multisets $\mod p^k$ with respect to their natural multiplicative action, completely describing them for a certain family of polynomials whenever $p$ is an odd prime. This elucidates…

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

Let $p$ be an odd prime. In the paper, by using the properties of Legendre polynomials we prove some congruences for $\sum_{k=0}^{\frac{p-1}2}\binom{2k}k^2m^{-k}\mod {p^2}$. In particular, we confirm several conjectures of Z.W. Sun. We also…

In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$…

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…

The aim of this work is to establish congruences $\left( \operatorname{mod}p^{2}\right) $ involving the trinomial coefficients $\binom{np-1}{p-1}_{2}$ and $\binom{np-1}{\left( p-1\right)/2}_{2}$ arising from the expansion of the powers of…

In this paper we prove some transformation formulae for congruences modulo a prime and deduce some congruences for Domb numbers and Almkvist-Zudilin numbers. We also pose some conjectures on congruences modulo prime powers.

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

Recently, using modular forms F. Beukers posed a unified method that can deal with a large number of supercongruences involving binomial coefficients and Ap\'ery-like numbers. In this paper, we use Beukers' method to prove some conjectures…

Let p be any prime, and let a and n be nonnegative integers. Let $r\in Z$ and $f(x)\in Z[x]$. We establish the congruence $$p^{\deg f}\sum_{k=r(mod p^a)}\binom{n}{k}(-1)^k f((k-r)/p^a) =0 (mod p^{\sum_{i=a}^{\infty}[n/p^i]})$$ (motivated by…

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 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 the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv \lambda\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large…

Let $p$ be an odd prime and let $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv…

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