Search arXivSearch

arXiv · 2608.14453

New Congruences Involving $p$-adic dual sequences

Abstract

Let $(a_n)_{n\geqslant 0}$ be a sequence of integers. Its dual sequence $(a_n^*)_{n\geqslant 0}$ is defined by \begin{equation*} a_n^* := \sum_{k=0}^{n} \binom{n}{k}(-1)^k a_k. \end{equation*} Let $p>3$ be a prime. In this paper we mainly investigate congruences modulo $p^2$ involving central binomial coefficients and $p$-adic dual sequences. For example, we prove that for any sequence $(a_k)_{k\ge0}$ of $p$-adic integers, \begin{align*} \sum^{(p-1)/2}_{k=0}\binom{2k}{k}^2\frac{a_{2k}}{16^k}\equiv\left( \frac{-1}{p}\right) \sum_{k=0}^{p-1}\frac{\mathcal{P}_{k}}{16 ^{k}}a_{k}^*\pmod{p^2}, \end{align*} where $(\mathcal{P}_n)_{n\ge0}$ are the Catalan--Larcombe--French numbers given by \begin{equation*} \mathcal{P}_0=1,\quad \mathcal{P}_1=8, \quad n^2 \mathcal{P}_n = 8(3n^2-3n+1)\mathcal{P}_{n-1}-128(n-1)^2\mathcal{P}_{n-2} \quad (n\ge2). \end{equation*} We also establish a new formula for $\sum_{k=0}^{(p-1)/2}\binom{2k}{k}a_{2k}^*/4^k \pmod{p^2}$ and as a consequence we confirm some conjectures of Z.-W. Sun \cite{Sun2014CANT} on the generalized central trinomial coefficients $T_{2k}(b,c)$, i.e., the coefficient of $x^{2k}$ in $(x^2+bx+c)^{2k}$, where $b,c$ are integers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yassine Otmani. 2026-08-19. New Congruences Involving $p$-adic dual sequences. https://arxiv.org/abs/2608.14453

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