Published online by Cambridge University Press: 20 November 2018
If Φk(n) denotes the Schemmel totient (so that Φ1 (n) becomes the Euler totient) we conjecture that for each k ≥ 1 and any given integer n > 1 there exist infinitely many m for which the equation Φk(x) = m has exactly n solutions. For the case k = 1, this gives Sierpinski's conjecture.
We prove that on the basis of Schinzel's Hypothesis H, our conjecture holds for any k ≥ 3 of the form where p0 is an odd prime and α ∊ N. In 1961 Schinzel proved the case k = 1 assuming his Hypothesis H.