Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2410.14605

Universal sums via products of Ramanujan's theta functions

Nasser Abdo Saeed Bulkhali·Zhi-Wei Sun
View original source ↗Read source document ↗Export metadata ↓

Abstract

An integer-valued polynomial $P(x,y,z)$ is said to be universal (over $\mathbb Z$) if each nonnegative integer can be written as $P(x,y,z)$ with $x,y,z\in\mathbb Z$. In this paper, we mainly introduce a new technique to determine the universality of some sums in the form $x(a_1x+a_2)/2+y(b_1y+b_2)/2+z(c_1z+c_2)/2$ (with $a_1-a_2,b_1-b_2,c_1-c_2$ all even) conjectured by Sun, using various identities of Ramanujan's theta functions. For example, we prove that $x(3x+1)+y(3y+2)+2z(3z+2)$ and $x(4x+r)+y(3y+1)/2+z(7z+1)/2\ (r=1,3)$ are universal.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nasser Abdo Saeed Bulkhali, Zhi-Wei Sun. 2026-02-25. Universal sums via products of Ramanujan's theta functions. https://arxiv.org/abs/2410.14605

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗