Search arXivSearch

arXiv · 1810.04742

Jordan totient quotients

Abstract

The Jordan totient $J_k(n)$ can be defined by $J_k(n)=n^k\prod_{p\mid n}(1-p^{-k})$. In this paper, we study the average behavior of fractions $P/Q$ of two products $P$ and $Q$ of Jordan totients, which we call Jordan totient quotients. To this end, we describe two general and ready-to-use methods that allow one to deal with a larger class of totient functions. The first one is elementary and the second one uses an advanced method due to Balakrishnan and Pétermann. As an application, we determine the average behavior of the Jordan totient quotient, the $k^{th}$ normalized derivative of the $n^{th}$ cyclotomic polynomial $Φ_n(z)$ at $z=1$, the second normalized derivative of the $n^{th}$ cyclotomic polynomial $Φ_n(z)$ at $z=-1$, and the average order of the Schwarzian derivative of $Φ_n(z)$ at $z=1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pieter Moree, Sumaia Saad Eddin, Alisa Sedunova, Yuta Suzuki. 2019-08-27. Jordan totient quotients. https://doi.org/10.1016/j.jnt.2019.08.014

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