On nontotients (Q1208181)

Let \(\varphi(x)\) be Euler's totient function. If the equation \(\varphi(x)=n\) has no solution, then \(n\) is called a nontotient. In this paper, the author proves that a nontotient can have an arbitrary divisor and the author gives two sorts of odd numbers such that for the odd number \(k\) of the first sort \(2^ \alpha\cdot k\) is a nontotient for a given positive integer \(a\) while for the odd number \(k\) of the second sort, \(2^ \alpha\cdot k\) is a nontotient for arbitrary positive integer \(a\).