DSpace Repository

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

Show simple item record

dc.contributor.author Eyyunni, Pramod
dc.date.accessioned 2023-08-18T03:54:33Z
dc.date.available 2023-08-18T03:54:33Z
dc.date.issued 2019-08
dc.identifier.uri https://link.springer.com/article/10.1007/s12044-019-0512-x
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11492
dc.description.abstract In this article, we investigate sparse subsets of the natural numbers and study the sparseness of some sets associated to the Euler’s totient function φ via the property of ‘Banach density’. These sets related to the totient function are defined as follows: V := φ(N) and Ni := {Ni (m) : m ∈ V} for i = 1, 2, 3, where N1(m) = max{x ∈ N: φ(x) ≤ m}, N2(m) = max(φ −1(m)) and N3(m) = min(φ −1(m)) for m ∈ V. Masser and Shiu (Pacific J. Math. 121(2) (1986) 407–426) called the elements of N1 as ‘sparsely totient numbers’ and constructed an infinite family of these numbers. Here we construct several infinite families of numbers in N2 \ N1 and an infinite family of composite numbers in N3. We also study (i) the ratio N2(m) N3(m) which is linked to the Carmichael’s conjecture, namely, |φ −1(m)| ≥ 2 for all m ∈ V, and (ii) arithmetic and geometric progressions in N2 and N3. Finally, using the above sets associated to the totient function, we generate an infinite class of subsets of N, each with asymptotic density zero and containing arbitrarily long arithmetic progressions. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Mathematics en_US
dc.subject Euler’s function en_US
dc.subject Sparsely totient numbers en_US
dc.subject Banach density en_US
dc.title Sparse subsets of the natural numbers and Euler’s totient function en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account