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

dc.contributor.authorEyyunni, Pramod
dc.date.accessioned2023-08-18T03:54:33Z
dc.date.available2023-08-18T03:54:33Z
dc.date.issued2019-08
dc.description.abstractIn 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.identifier.urihttps://link.springer.com/article/10.1007/s12044-019-0512-x
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11492
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectMathematicsen_US
dc.subjectEuler’s functionen_US
dc.subjectSparsely totient numbersen_US
dc.subjectBanach densityen_US
dc.titleSparse subsets of the natural numbers and Euler’s totient functionen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: