English
Related papers

Related papers: Congruences involving binomial coefficients and Ap…

200 papers

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

Combinatorics · Mathematics 2025-07-29 Christian Krattenthaler , Thomas W. Müller

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

Number Theory · Mathematics 2025-06-17 Frits Beukers

The inverse central binomial series {equation}S_k(z)=\sum_{n=1}^{\infty}\frac{n^k z^n}{\binom{2n}{n}}{equation} popularized by Ap\'ery and Lehmer is evaluated for positive integers $k$ along with the asymptotic behavior for large $k$. It is…

Classical Analysis and ODEs · Mathematics 2012-04-06 M. L. Glasser

The central Delannoy numbers $D_n=\sum_{k=0}^{n}\binom{n}{k}\binom{n+k}{k}$ and the little Schr\"oder number $s_n=\sum_{k=1}^{n}\frac{1}{n}\binom{n}{k}\binom{n}{k-1}2^{n-k}$ are important quantities. In this paper, we confirm…

Number Theory · Mathematics 2024-10-24 Chen-Bo Jia , Jia-Qing Huang

In this paper we prove that for any prime $p\ge 11$ holds $$ {2p-1\choose p-1}\equiv 1 -2p \sum_{k=1}^{p-1}\frac{1}{k} +4p^2\sum_{1\le i<j\le p-1}\frac{1}{ij}\pmod{p^7}. $$ This is a generalization of the famous Wolstenholme's theorem which…

Number Theory · Mathematics 2018-04-10 Romeo Mestrovic

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

Number Theory · Mathematics 2013-01-29 Donald M. Davis

In this paper, we prove two supercongruences by the Wilf-Zeilberger method. One of them is, for any prime $p>3$, \begin{align*} \sum_{n=0}^{(p-1)/2}\frac{3n+1}{(-8)^n}\binom{2n}n^3\equiv…

Number Theory · Mathematics 2021-11-18 Guo-Shuai Mao

We prove that, if $m,n\geqslant 1$ and $a_1,\ldots,a_m$ are nonnegative integers, then \begin{align*} \frac{[a_1+\cdots+a_m+1]!}{[a_1]!\ldots[a_m]!}\sum^{n-1}_{h=0}q^h\prod_{i=1}^m{h\brack a_i} \equiv 0\pmod{[n]}, \end{align*} where…

Number Theory · Mathematics 2015-04-22 Victor J. W. Guo , Ji-Cai Liu

One of the many remarkable properties of the Ap\'ery numbers $A (n)$, introduced in Ap\'ery's proof of the irrationality of $\zeta (3)$, is that they satisfy the two-term supercongruences \begin{equation*} A (p^r m) \equiv A (p^{r - 1} m)…

Number Theory · Mathematics 2016-01-20 Armin Straub

In this paper, we deduce a family of six new series for $1/\pi$; for example, $$\sum_{n=0}^\infty\frac{41673840n+4777111}{5780^n}W_n\left(\frac{1444}{1445}\right) =\frac{147758475}{\sqrt{95}\,\pi}$$ where $W_n(x)=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2023-02-23 Zhi-Wei Sun

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

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

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 ${\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

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

Put $a(n)=\sum\limits_{k=0}^{n}\binom{n}{k}\binom{n+k}{k}$, and $b(n)=v_{3}(a(n))$, for all integers $n\geqslant 0$, where $v_{3}$ is the $3$-adic valuation. In this work, we shall confirm a formula about $b(n)$, conjectured by J. Shallit…

Number Theory · Mathematics 2022-01-04 Zhao Shen

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

Let $p>3$ be a prime, $a_1,a_2,a_3\in\Bbb Z$ and let $N_p(x^3+a_1x^2+a_2x+a_3)$ denote the number of solutions to the congruence $x^3+a_1x^2+a_2x+a_3\equiv 0\pmod p$. In this paper, we give an explicit criterion for…

Number Theory · Mathematics 2025-04-02 Zhi-Hong Sun

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 2014-06-25 Tewodros Amdeberhan

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
‹ Prev 1 8 9 10 Next ›