Search arXivSearch

arXiv · 1704.05200

Continued Fractions and $q$-Series Generating Functions for the Generalized Sum-of-Divisors Functions

Abstract

We construct new continued fraction expansions of Jacobi-type J-fractions in $z$ whose power series expansions generate the ratio of the $q$-Pochhamer symbols, $(a; q)_n / (b; q)_n$, for all integers $n \geq 0$ and where $a,b,q \in \mathbb{C}$ are non-zero and defined such that $|q| < 1$ and $|b/a| < |z| < 1$. If we set the parameters $(a, b) := (q, q^2)$ in these generalized series expansions, then we have a corresponding J-fraction enumerating the sequence of terms $(1-q) / (1-q^{n+1})$ over all integers $n \geq 0$. Thus we are able to define new $q$-series expansions which correspond to the Lambert series generating the divisor function, $d(n)$, when we set $z \mapsto q$ in our new J-fraction expansions. By repeated differentiation with respect to $z$, we also use these generating functions to formulate new $q$-series expansions of the generating functions for the sums-of-divisors functions, $σ_α(n)$, when $α\in \mathbb{Z}^{+}$. To expand the new $q$-series generating functions for these special arithmetic functions we define a generalized classes of so-termed Stirling-number-like "$q$-coefficients", or Stirling $q$-coefficients, whose properties, relations to elementary symmetric polynomials, and relations to the convergents to our infinite J-fractions are also explored within the results proved in the article.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maxie D. Schmidt. 2017-05-04. Continued Fractions and $q$-Series Generating Functions for the Generalized Sum-of-Divisors Functions. https://doi.org/10.1016/j.jnt.2017.05.023

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