“TotientValenceFunction”的概念、定义、习题解题方法及翻译-数学辞典

单词	TotientValenceFunction
释义	totient valence function Given an integer $n$ , count how many integers $m$ in the set $\\{n+1,n+2,\\ldots n^{2}\\}$ satisfy $\\phi(m)=n$ . This is the totient valence of $n$ , usually labelled $N_{\\phi}(n)$ . (The only two special cases are 2 and 6, for which one has to look a little beyound $n^{2}$ ). Robert Carmichael conjectured that $N_{\\phi}(n)=1$ never. Two sequences in Sloane’s OEIS that list numbers with higher totient valences than preceding numbers are A007374 and A097942.
随便看	proof of Borel-Cantelli 2 ProofOfBorelFunctionalCalculus proof of Borel functional calculus ProofOfBorsukUlamTheorem proof of Borsuk-Ulam theorem ProofOfBoundedLinearFunctionalsOnLpmu proof of bounded linear functionals on L^p⁢(μ) ProofOfBoundsForE proof of bounds for e ProofOfBrahmaguptasFormula proof of Brahmagupta’s formula ProofOfBrouwerFixedPointTheorem proof of Brouwer fixed point theorem proof of Brouwer fixed point theorem ProofOfBrouwerFixedPointTheorem1 ProofOfButterflyTheorem proof of butterfly theorem ProofOfCalculusTheoremUsedInTheLagrangeMethod proof of calculus theorem used in the Lagrange method ProofOfCantorsTheorem proof of Cantor’s theorem ProofOfCapacityGeneratedByAMeasure proof of capacity generated by a measure ProofOfCaratheodorysExtensionTheorem ProofOfCaratheodorysLemma

数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。

totient valence function