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$ .
随便看	étale fundamental group étale morphism Čunihin’s theorem Łukasiewicz-Moisil Many-Valued Logic Algebra of Highly-Complex Systems vs the Q-logics of Quantum Automata and Chryssippian Logic Štefan Znám Γ-equivariant Γ-simple Δ_1 bootstrapping Π-types and the function extensionality axiom Σ-types Ψ is surjective if and only if Ψ^∗ is injective Ω-stability theorem ε-net η⁢(1)=l⁢n2 κ-categorical κ-complete μ-operator π_1⁢(S_1) π and π^2 are irrational π-groups and π′-groups π_{k≤n} of an n-connected space and π_{k<n}⁢(S^n) π-separable group σ-algebra σ-algebra σ-algebra at a stopping time