Search arXivSearch

arXiv · 2406.18059

On the binomial transforms of Apéry-like sequences

Abstract

In the proof of the irrationality of $ζ(3)$ and $ζ(2)$, Apéry defined two integer sequences through $3$-term recurrences, which are known as the famous Apéry numbers. Zagier, Almkvist--Zudilin and Cooper successively introduced the other $13$ sporadic sequences through variants of Apéry's $3$-term recurrences. All of the $15$ sporadic sequences are called Apéry-like sequences. Motivated by Gessel's congruences mod $24$ for the Apéry numbers, we investigate the congruences in the form $u_n\equiv α^n \pmod{N_α}~(α\in \mathbb{Z},N_α\in \mathbb{N}^{+})$ for all of the $15$ Apéry-like sequences $\{u_n\}_{n\ge 0}$. Let $N_α$ be the largest positive integer such that $u_n\equiv α^n \pmod{N_α}$ for all non-negative integers $n$. We determine the values of $\max\{N_α|α\in \mathbb{Z}\}$ for all of the $15$ Apéry-like sequences $\{u_n\}_{n\ge 0}$.The binomial transforms of Apéry-like sequences provide us a unified approach to this type of congruences for Apéry-like sequences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ji-Cai Liu. 2024-06-26. On the binomial transforms of Apéry-like sequences. https://arxiv.org/abs/2406.18059

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