Related papers: On Schemmel Nontotient Numbers
In 2009, Luca and Nicolae proved that the only Fibonacci numbers whose Euler totient function is another Fibonacci number are $1,2$, and $3$. In 2015, Faye and Luca proved that the only Pell numbers whose Euler totient function is another…
Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…
In this paper, we introduce and develop the notion of spanning of integers along functions $f:\mathbb{N}\longrightarrow \mathbb{R}$. We apply this method to a class of problems that requires to determine if the equations of the form…
We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…
A combinatorial expression for the coefficient of the Schur function $s_{\lambda}$ in the expansion of the plethysm $p_{n/d}^d \circ s_{\mu}$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $\lambda$ is rectangular. In…
In this paper we extend the Smarandache function from the set $N*$ of positive integers to the set $Q$ pf rational numbers. Using the inverse formula, this function is also regarded as a generating function. We put in evidence a procedure…
In this paper, we study some typical arithmetic properties of Euler's totient function of polynomials over finite fields. Especially, we study polynomial analogues of some classical conjectures about Euler's totient function, such as…
For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…
The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…
Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…
An unconditional inequality of the totient function is contributed to the literature. This result is associated with various problems about the distribution of prime numbers.
A composite positive integer n is Lehmer if \phi(n) divides n-1, where \phi(n) is the Euler's totient function. No Lehmer number is known, nor has it been proved that they don't exist. In 2007, the second author [7] proved that there is no…
The image of Euler's totient function is composed of the number 1 and even numbers. However, many even numbers are not in the image. We consider the problem of finding those even numbers which are in the image and those which are not. If an…
For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…
Let $\cal R$ be either the Grothendieck semiring (semiring with multiplication) of complex algebraic varieties, or the Grothendieck ring of these varieties, or the Grothendieck ring localized by the class of the complex affine line. We…
In 1963, Edward Spence published a proof of the following With $\phi$ being Euler totient function, if $n>1$ is an integer, and if \begin{equation*} 0<a_1<\cdots<a_{\phi(n)}<n, \end{equation*} are the positive integers less than $n$,…
One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…
Egge, Loehr and Warrington gave in \cite{ELW} a combinatorial formula that permits to convert the expansion of a symmetric function, homogeneous of degree $n$, in terms of Gessel's fundamental quasisymmetric functions into an expansion in…
A special case of a fundamental result of Loewner and Horn [Trans. Amer. Math. Soc. 1969] says that given an integer $n \geq 1$, if the entrywise application of a smooth function $f : (0,\infty) \to \mathbb{R}$ preserves the set of $n…
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…