Search arXivSearch

arXiv · 2507.04653

$q$-Congruences for Z.-W. Sun's generalized polynomials $w^{(α)}_k(x)$

Abstract

In 2022, Z.-W. Sun defined \begin{equation*} w_k^{(α)}{(x)}=\sum_{j=1}^{k}w(k,j)^αx^{j-1}, \end{equation*} where $k,α$ are positive integers and $w(k,j)=\frac{1}{j}\binom{k-1}{j-1}\binom{k+j}{j-1}$. Let $(x)_{0}=1$ and $(x)_{n}=x(x+1)\cdots(x+n-1)$ for all $n\geq 1$. In this paper, it is proved by $q$-congruences that for any positive integers ${α,β, m,n,r}$, we have \begin{equation*} \frac{(2,n)}{n(n+1)(n+2)}\sum_{k=1}^{n}k^r(k+1)^r(2k+1)w_{k}^{(α)}(x)^{m}\in\mathbb{Z}[x], \end{equation*} \begin{equation*} \frac{(2,n)}{n(n+1)(n+2)}\sum_{k=1}^{n}(-1)^{k}k^r(k+1)^r(2k+1) w_{k}^{(α)}(x)^{m}\in\mathbb{Z}[x], \end{equation*} and \begin{equation*} \frac{2}{[n,n+1,\cdots,n+2β+1]}\sum_{k=1}^{n}(k)_β^r(k+β+1)_β^r(k+β) \prod_{i=0}^{2β-1}w_{k+i}^{(α)}(x)^m\in\mathbb{Z}[x], \end{equation*} where $[n,n+1,\cdots,n+2β+1]$ is the least common multiple of $n$, $n+1$, $\cdots$, $n+2β+1$. Taking $r=β=1$ above will confirm some of Z.-W. Sun's conjectures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lin-Yue Li, Rong-Hua Wang. 2025-07-07. $q$-Congruences for Z.-W. Sun's generalized polynomials $w^{(α)}_k(x)$. https://arxiv.org/abs/2507.04653

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