相关论文: Some Congruences Involving Fourth Powers of Genera…

For $n\in\mathbb{N}=\{0,1,2,\ldots\}$ and $b,c\in\mathbb{Z}$, the $n$th generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. In particular, $T_n=T_n(1,1)$ is the central…

For any $n\in\mathbb{N}=\{0,1,2,\ldots\}$ and $b,c\in\mathbb{Z}$, the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Let $p$ be an odd prime. In this paper, we…

For integers $b$ and $c$ the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Those $T_n=T_n(1,1)\ (n=0,1,2,\ldots)$ are the usual central trinomial coefficients, and…

A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial…

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

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…

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…

Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let $p>3$ be a prime. We show that $$T_{p-1}\equiv\left(\frac p3\right)3^{p-1}\ \pmod{p^2},$$ where the central trinomial coefficient $T_n$ is…

Let $p>5$ be a prime. We prove congruences modulo $p^{3-d}$ for sums of the general form $\sum_{k=0}^{(p-3)/2}\binom{2k}{k}t^k/(2k+1)^{d+1}$ and $\sum_{k=1}^{(p-1)/2}\binom{2k}{k}t^k/k^d$ with $d=0,1$. We also consider the special case…

Let $p>3$ be a prime. In this paper, we obtain the congruences for $$\sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^3}{(-8)^k},\ \sum_{k=0}^{p-1}\frac{w(k)\binom{2k}k^2\binom{3k}k}{(-192)^k},\…

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

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…

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

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.

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 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 establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Let $p>3$ be a prime and let $a$ be a positive integer. We show that if $p\equiv1\pmod 4$ or $a>1$ then $$\sum_{k=0}^{\lfloor\frac34p^a\rfloor}\frac{\binom{2k}k^2}{16^k}\equiv\l(\frac{-1}{p^a}\r)\pmod{p^3}$$ with $(-)$ the Jacobi symbol,…

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…