Search arXivSearch

arXiv · 1008.2894

New congruences for sums involving Apery numbers or central Delannoy numbers

Abstract

The Apéry numbers $A_n$ and central Delannoy numbers $D_n$ are defined by $$A_n=\sum_{k=0}^{n}{n+k\choose 2k}^2{2k\choose k}^2, \quad D_n=\sum_{k=0}^{n}{n+k\choose 2k}{2k\choose k}. $$ Motivated by some recent work of Z.-W. Sun, we prove the following congruences: \sum_{k=0}^{n-1}(2k+1)^{2r+1}A_k &\equiv \sum_{k=0}^{n-1}\varepsilon^k (2k+1)^{2r+1}D_k \equiv 0\pmod n, where $n\geqslant 1$, $r\geqslant 0$, and $\varepsilon=\pm1$. For $r=1$, we further show that \sum_{k=0}^{n-1}(2k+1)^{3}A_k &\equiv 0\pmod{n^3}, \quad \sum_{k=0}^{p-1}(2k+1)^{3}A_k &\equiv p^3 \pmod{2p^6}, where $p>3$ is a prime. The following congruence \sum_{k=0}^{n-1} {n+k\choose k}^2{n-1\choose k}^2 \equiv 0 \pmod{n} plays an important role in our proof.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor J. W. Guo, Jiang Zeng. 2012-05-25. New congruences for sums involving Apery numbers or central Delannoy numbers. https://arxiv.org/abs/1008.2894

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT