Combinatorial properties of sparsely totient numbers

MaRDI QIDQ5109962zbMATH OpenFDO

Authors Mithun Kumar Das, Pramod Eyyunni, Bhuwanesh Rao Patil

Publication date 14 May 2020

Full work available at URL https://arxiv.org/abs/1907.09923, http://www.mathjournals.org/jrms/2020-035-001/2020-035-001-001.html

zbMATH Keywords

sparsely 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: Let $N_1(m)=maxncolonphi(n)leqm$ and $N_1=N_1(m)colonminphi(mathbbN)$ where $phi(n)$ denotes the Euler's totient function. Masser and Shiu cite{masser} call the elements of $N_1$ as `sparsely totient numbers' and initiated the study of these numbers. In this article, we establish several results for sparsely totient numbers. First, we show that a squarefree integer divides all sufficiently large sparsely totient numbers and a non-squarefree integer divides infinitely many sparsely totient numbers. Next, we construct explicit infinite families of sparsely totient numbers and describe their relationship with the distribution of consecutive primes. We also study the sparseness of $N_1$ and prove that it is multiplicatively piecewise syndetic but not additively piecewise syndetic. Finally, we investigate arithmetic/geometric progressions and other additive and multiplicative patterns like $x,y,x+y,x,y,xy,x+y,xy$ and their generalizations in the sparsely totient numbers.

Recommendations

• On sparsely totient numbers
• On sparsely totient numbers
• Sparsely totient numbers
• On sparsely Schemmel totient numbers
• Sparse subsets of the natural numbers and Euler's totient function
• On sums of sparse prime subsets
• Combinatorial aspects of the generalized Euler's totient
• scientific article; zbMATH DE number 3895163
• Exponential sums and prime divisors of sparse integers

Cited in

(8)

• On integers n with \(J_ t(n)<J_ t(m)\) for \(m>n\)
• Sparsely totient numbers
• The sequence \(x/n\) and its subsequences
• Sparse subsets of the natural numbers and Euler's totient function
• On sparsely Schemmel totient numbers
• On sparsely totient numbers
• On sparsely totient numbers
• On additive complements with special structures

This page was built for publication: Combinatorial properties of sparsely totient numbers

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