English
Related papers

Related papers: Supercongruences via Beukers' method

200 papers

Z.-W. Sun introduced three kinds of numbers: \begin{align*}S_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1),\qquad s_n=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}\frac{1}{2k-1}, \end{align*} and $S_n^{+}=\sum_{k=0}^{n}{n\choose…

Number Theory · Mathematics 2014-12-18 Victor J. W. Guo , Ji-Cai Liu

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

Number Theory · Mathematics 2017-03-08 Sandro Mattarei , Roberto Tauraso

By means of partial fraction method, we investigate the decomposition of rational functions. Several striking identities on harmonic numbers and generalized Apery numbers will be established, including the binomial-harmonic number identity…

Combinatorics · Mathematics 2007-05-23 Wenchang Chu

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

Number Theory · Mathematics 2012-04-10 Victor J. W. Guo , Jiang Zeng

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

Number Theory · Mathematics 2026-02-11 Zhi-Wei Sun

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…

Number Theory · Mathematics 2023-08-01 Mohammed Mechacha

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

We mainly introduce two new kinds of numbers given by $$R_n=\sum_{k=0}^n\binom nk\binom{n+k}k\frac1{2k-1}\quad\ (n=0,1,2,...)$$ and $$S_n=\sum_{k=0}^n\binom nk^2\binom{2k}k(2k+1)\quad\ (n=0,1,2,...).$$ We find that such numbers have many…

Number Theory · Mathematics 2018-11-13 Zhi-Wei Sun

In this paper, we employ the Wilf-Zeilberger (WZ) method to prove a supercongruence conjecture posed by Z.-W. Sun: for any prime $p$, \begin{align*} \sum_{k=0}^{\frac{p-3}{2}}\frac{92k^2+61k+9}{(2k+1)64^k}{2k \choose k}{3k \choose k}{4k…

Combinatorics · Mathematics 2026-03-20 Wei-Wei Qi

In this paper, we consider two particular binomial sums \begin{align*} \sum_{k=0}^{n-1}(20k^2+8k+1){\binom{2k}{k}}^5 (-4096)^{n-k-1} \end{align*} and \begin{align*} \sum_{k=0}^{n-1}(120k^2+34k+3){\binom{2k}{k}}^4\binom{4k}{2k}…

Combinatorics · Mathematics 2016-11-07 Brian Y. Sun

It is shown that for any prime $p$ and any natural numbers $\ell, m,$ and $s$ such that $0<s<p$, the three following congruences \begin{align*}\sum_{i\ge \ell+1}(-1)^{m-i} {m \choose i}{m+s-1+i(p-1) \choose m+s-1+\ell(p-1)} &\equiv 0 \bmod…

Number Theory · Mathematics 2020-08-04 René Gy

We develop an analytical method to prove congruences of the type $$ \sum_{k=0}^{(p^r-1)/d}A_kz^k \equiv \omega(z)\sum_{k=0}^{(p^{r-1}-1)/d}A_kz^{pk} \pmod{p^{mr}\mathbb Z_p[[z]]} \quad \text{for}\; r=1,2,\dots, $$ for primes $p>2$ and fixed…

Number Theory · Mathematics 2020-11-30 Victor J. W. Guo , Wadim Zudilin

In 2003, Zhao discovered a curious congruence involving harmonic series and Bernoulli numbers: for any odd prime $p$, $$\sum_{\substack{i,j,k\ge 1\\\gcd(ijk,p)=1\\i+j+k=p}}\frac{1}{ijk}\equiv -2B_{p-3} \pmod{p},$$ where $B_n$ is the $n$-th…

Number Theory · Mathematics 2021-10-20 Shane Chern

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

Number Theory · Mathematics 2024-09-04 Fernando Szechtman

Using Hecke characters, we construct two infinite families of newforms with complex multiplication, one by $\mathbb{Q}(\sqrt{-3})$ and the other by $\mathbb{Q}(\sqrt{-2})$. The values of the $p$-th Fourier coefficients of all the forms in…

Number Theory · Mathematics 2018-07-12 Alexis Gomez , Dermot McCarthy , Dylan Young

With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $\rho,n\geq 2$, $$\sum_{k=0}^{n-1}(4k+1) \binom{2k}{k}^\rho \cdot (-4)^{\rho(n-1-k)} \equiv 0\pmod{2^{\rho-2}n\binom{2n}{n}}.$$

Number Theory · Mathematics 2018-08-10 He-Xia Ni , Hao Pan

Dirichlet's $L$-functions are natural extensions of the Riemann zeta function. In this paper we first give a brief survey of Ap\'ery-like series for some special values of the zeta function and certain $L$-functions. Then, we establish two…

Number Theory · Mathematics 2016-01-13 Zhi-Wei Sun

Using an identity arising in the known Banach probability problem on matchboxes, we prove an unexpected congruence for odd prime $p:$ for $1\leq k\leq \frac{p-1}{2},\enskip \sum_{i=1}^{p-2k-1}2^{i-1}\binom{k-1+i}{k}\equiv 0\pmod p.$

History and Overview · Mathematics 2011-10-27 Vladimir Shevelev

In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order…

Number Theory · Mathematics 2015-12-21 Khodabakhsh Hessami Pilehrood , Tatiana Hessami Pilehrood

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun