noncototient

An integer $n>0$ is called a noncototient if there is no solutionto $x-{\\phi}(x)=n$ , where ${\\phi}(x)$ is Euler’s totient function. The first few noncototients are 10, 26, 34, 50, 52, 58, 86, 100, 116, 122, 130 (listed in A005278 of Sloane’s OEIS).

Browkin and Schinzel proved in 1995 that there are infinitely many noncototients. What is still unknown is whether they are all even. Goldbach’s conjecture would seem to suggest that this is the case: given a semiprime $p q$ , it follows that $pq-{\\phi}(pq)=pq-(p-1)(q-1)=p+q-1$ , an odd number if $2<p\\leq q$ .

单词	Noncototient
释义	noncototient An integer $n>0$ is called a noncototient if there is no solutionto $x-{\\phi}(x)=n$ , where ${\\phi}(x)$ is Euler’s totient function. The first few noncototients are 10, 26, 34, 50, 52, 58, 86, 100, 116, 122, 130 (listed in A005278 of Sloane’s OEIS). Browkin and Schinzel proved in 1995 that there are infinitely many noncototients. What is still unknown is whether they are all even. Goldbach’s conjecture would seem to suggest that this is the case: given a semiprime $p q$ , it follows that $pq-{\\phi}(pq)=pq-(p-1)(q-1)=p+q-1$ , an odd number if $2<p\\leq q$ .
随便看	asymptotics of central binomial coefficient Atom atom AtomicFormula atomic formula AtommeasureTheory atom (measure theory) AttachmentToTextbookProjectsOnPlanetMath Attachment to Textbook projects on PlanetMath AttractingFixedPoint attracting fixed point Attractor attractor AutocovarianceFunction autocovariance function AutomaticGroup automatic group AutomaticPresentation automatic presentation Automaton automaton AutomatonOverAMonoid automaton over a monoid AutomorphicNumber automorphic number