On sparsely Schemmel totient numbers

zbMATH Open1322.11006arXiv1412.3080MaRDI QIDQ5262034FDOQ5262034

Authors: Colin Defant 

Publication date: 9 July 2015

Abstract: For each positive integer $r$, let $S_r$ denote the $r^{th}$ Schemmel totient function, a multiplicative arithmetic function defined by [S_r(p^{alpha})=�egin{cases} 0, & mbox{if } pleq r; \ p^{alpha-1}(p-r), & mbox{if } p>r end{cases}] for all primes $p$ and positive integers $alpha$. The function $S_1$ is simply Euler's totient function $phi$. Masser and Shiu have established several fascinating results concerning sparsely totient numbers, positive integers $n$ satisfying $phi(n)<phi(m)$ for all integers $m>n$. We define a sparsely Schemmel totient number of order $r$ to be a positive integer $n$ such that $S_r(n)>0$ and $S_r(n)<S_r(m)$ for all $m>n$ with $S_r(m)>0$. We then generalize some of the results of Masser and Shiu.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• On sparsely totient numbers
• Combinatorial properties of sparsely totient numbers
• On Schemmel nontotient numbers
• On sparsely totient numbers
• On integers n with \(J_ t(n)<J_ t(m)\) for \(m>n\)

zbMATH Keywords

asymptotic resultsSchemmel's totient functions

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Asymptotic results on arithmetic functions (11N37)

Cited In (6)

• On the eigenstructure of sparse matrices related to the prime number theorem
• Combinatorial properties of sparsely totient numbers
• On integers n with \(J_ t(n)<J_ t(m)\) for \(m>n\)
• On sparsely totient numbers
• Sparseness for the symmetric hit problem at all primes
• On Schemmel nontotient numbers

Uses Software

• Mathematica

This page was built for publication: On sparsely Schemmel totient numbers

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