English
Related papers

Related papers: Supercongruences via Beukers' method

200 papers

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

Number Theory · Mathematics 2014-10-14 Liuquan Wang

We study two new classes of sums with inverse binomial coefficients and harmonic numbers. In addition we establish recursive solutions to the following power sums \begin{equation*} U_d(n) = \sum_{k=1}^n \frac{2^{2k}}{\binom{2k}{k}} \cdot…

Number Theory · Mathematics 2026-02-09 Micheal Bataille , Robert Frontczak

For integers $n,k \geq 1$, let $S_k(n)$ denote the power sum $1^k +2^k + \cdots + n^k$. In this note, we first recall the minimal recurrence relation connecting $S_k(n)$ and $S_{k-1}(n)$ established by Abramovich (1973). We then discuss an…

History and Overview · Mathematics 2026-01-30 José L. Cereceda

In this paper, we prove Dahmen and Beukers' conjecture that the number of integral Lam\'{e} equations with index $n$ modulo scalar equivalence with the monodromy group dihedral $D_{N}$ of order $2N$ is given by \[L_{n}(N)=\frac{1}{2}\left(…

Number Theory · Mathematics 2021-05-12 Zhijie Chen , Ting-Jung Kuo , Chang-Shou Lin

We explicitly determine the Ap\'ery limits for the sums of powers of binomial coefficients. As an application, we prove a weak version of Franel's conjecture on the order of the recurrences for these sequences. Namely, we prove the…

Number Theory · Mathematics 2023-06-27 Armin Straub , Wadim Zudilin

In this paper, we investigate some congruences involving sums of $\frac{d^{-k}{x\choose k}{x+k\choose k}}{{2k \choose k}}$, where $x$ be a $p$-adic integer, $k$ be a non-negative integer, and $d$ $(d\neq 0)$ be a rational number.

Number Theory · Mathematics 2025-12-02 Wei-Wei Qi

We show that if p is an odd prime then $$\sum_{k=0}^{p-1}E_kE_{p-1-k}=1 (mod p)$$ and $$\sum_{k=0}^{p-3}E_kE_{p-3-k}=(-1)^{(p-1)/2}2E_{p-3} (mod p),$$ where E_0,E_1,E_2,... are Euler numbers. Moreover, we prove that for any positive integer…

Number Theory · Mathematics 2010-12-22 Zhi-Wei Sun

Let $\{a_{1}, a_{2},\ldots, a_{n},\ldots\}$ be a sequence of complex numbers which has at most polynomial growth and satisfies an extra assumption. In this paper, inspired by a recent work of Sasane, we give an explanation of the sum…

Number Theory · Mathematics 2023-05-04 Su Hu , Min-Soo Kim

We find new representations, in terms of constant terms of powers of Laurent polynomials, for all the 15 sporadic Ap{\'e}ry-like sequences discovered by Zagier, Almkvist-Zudilin and Cooper. The new representations lead to binomial…

Number Theory · Mathematics 2025-01-07 Ofir Gorodetsky

We give q-analogues of the following congruences by Z.-W. Sun: \sum_{k=1}^{p-1}\frac{D_k}{k} \equiv -\frac{2^{p-1}-1}{p} \pmod p,\\ \sum_{k=1}^{p-1}\frac{H_k}{k 2^k}\equiv 0 \pmod{p},\quad p\geqslant 5, where p is a prime,…

Number Theory · Mathematics 2013-12-24 Victor J. W. Guo

Using the $q$-Wilf--Zeilberger method and a $q$-analogue of a "divergent" Ramanujan-type supercongruence, we give several $q$-supercongruences modulo the fourth power of a cyclotomic polynomial. One of them is a $q$-analogue of a…

Number Theory · Mathematics 2020-04-23 Victor J. W. Guo

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…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

The sequence $A(n)_{n \geq 0}$ of Ap\'ery numbers can be interpolated to $\mathbb{C}$ by an entire function. We give a formula for the Taylor coefficients of this function, centered at the origin, as a $\mathbb{Z}$-linear combination of…

Number Theory · Mathematics 2023-09-04 Eric Rowland , Reem Yassawi , Christian Krattenthaler

Let $[x]$ be the greatest integer not exceeding $x$. In the paper we introduce the sequence $\{U_n\}$ given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]}\binom n{2k}U_{n-2k}\quad(n\ge 1)$, and establish many recursive formulas and congruences…

Number Theory · Mathematics 2010-12-21 Zhi-Hong Sun

During the study of dual sequences, Sun introduced the polynomials \[ D_n(x,y)=\sum_{k=0}^{n}{n\choose k}{x\choose k}y^k\text{ and } S_n(x,y)=\sum_{k=0}^{n}\binom{n}{k}\binom{x}{k}\binom{-1-x}{k} y^k. \] Many related congruences have been…

Combinatorics · Mathematics 2020-10-26 Rong-Hua Wang , Michael X. X. Zhong

Let $p$ be a prime and ${\mathfrak P}_p$ the set of positive integers which are prime to $p$. Recently, Wang and Cai proved that for every positive integer $r$ and prime $p>2$ $$ \sum_{\substack{i+j+k=p^r\\ i,j,k\in{\mathfrak P}_p}}…

Number Theory · Mathematics 2018-04-06 Jianqiang Zhao

We prove that $\sum_{k=0}^{q-1}\binom{2k}{k}\equiv q^2\pmod{3q^2}$ if q>1 is a power of 3, as recently conjectured by Z.W. Sun and R. Tauraso. Our more precise result actually implies that the value of $(1/q^2)\sum_{k=0}^{q-1}\binom{2k}{k}$…

Number Theory · Mathematics 2010-01-14 Sandro Mattarei

Let $\overline{B}_{s,t}(n)$ denote the number of overpartitions of $n$ where no part is divisible by $s$ or $t$, with $s$ and $t$ being coprime. By establishing the exact generating functions of a family of arithmetic progressions in…

Number Theory · Mathematics 2025-03-26 Dazhao Tang

We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Ap\'{e}ry numbers, by means of a general…

Number Theory · Mathematics 2019-12-03 Ofir Gorodetsky

Let $p>3$ be a prime and $m,n\in\Bbb Z$ with $p\nmid mn$. Built on the work of Morton, in the paper we prove the uniform congruence: $$&\sum_{x=0}^{p-1}\Big(\frac{x^3+mx+n}p\Big) \equiv {-(-3m)^{\frac{p-1}4} \sum_{k=0}^{p-1}\binom{-\frac…

Number Theory · Mathematics 2012-02-14 Zhi-Hong Sun
‹ Prev 1 8 9 10 Next ›