Sparse subsets of the natural numbers and Euler's totient function

DOI10.1007/S12044-019-0512-XMaRDI QIDQ2274801zbMATH OpenOpenAlexFDO

Authors Mithun Kumar Das, Pramod Eyyunni, Bhuwanesh Rao Patil

Publication date 1 October 2019

Published in Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.09847

zbMATH Keywords

Banach densityEuler's functionsparsely totient numbers

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Density, gaps, topology (11B05) Arithmetic progressions (11B25) Other combinatorial number theory (11B75)

Abstract: In this article, we investigate sparse subsets of the natural numbers and study the sparseness of some sets associated with the Euler's totient function $phi$ via the property of `Banach Density'. These sets related to the totient function are defined as follows: $V:=phi(mathbbN)$ and $N_i:=N_i(m)colonminV$ for $i=1,2,3,$ where $N_1(m)=maxxinmathbbNcolonphi(x)leqm$, $N_2(m)=max(ph{i}^{-1}(m))$ and $N_3(m)=min(ph{i}^{-1}(m))$ for $minV$. Masser and Shiu call the elements of $N_1$ as `sparsely totient numbers' and construct an infinite family of these numbers. Here we construct several infinite families of numbers in $N_{2}setminus{N}_1$ and an infinite family of composite numbers in $N_3$. We also study (i) the ratio $frac{N}_2(m)N_3(m)$, which is linked to the Carmichael's conjecture, namely, $|ph{i}^{-1}(m)|geq2forallminV$, and (ii) arithmetic and geometric progressions in $N_2$ and $N_3$. Finally, using the above sets associated to the totient function, we generate an infinite class of subsets of $mathbbN$, each with asymptotic density zero and containing arbitrarily long arithmetic progressions.

Recommendations

• Combinatorial properties of sparsely totient numbers
• On sparsely totient numbers
• On integers n with \(J_ t(n)<J_ t(m)\) for \(m>n\)
• Popular subsets for Euler's \(\varphi \)-function
• On the local structure of the set of values of Euler’s $\varphi $ function

Cites work

• A new proof of Szemerédi's theorem
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Combinatorial number theory and additive group theory. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse)
• scientific article; zbMATH DE number 1542664 (Why is no real title available?)
• On sparsely totient numbers
• On the Equation π(x) = 2m
• On the sum of digits of the factorial
• Some remark on Euler's φ function
• Sumset phenomenon in countable amenable groups
• The distribution of totients
• The primes contain arbitrarily long arithmetic progressions

Cited in

(5)

• Correction to: ``Sparse subsets of the natural numbers and Euler's totient function
• Existence of some sparse sets of nonstandard natural numbers
• Arithmetic properties of sparse subsets of $\mathbb{Z}^n$
• On the local structure of the set of values of Euler’s $\varphi $ function
• Combinatorial properties of sparsely totient numbers

This page was built for publication: Sparse subsets of the natural numbers and Euler's totient function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274801)