请输入您要查询的字词:

 

单词 TotientValenceFunction
释义

totient valence function


Given an integer n, count how many integers m in the set {n+1,n+2,n2} satisfy ϕ(m)=n. This is the totient valence of n, usually labelled Nϕ(n). (The only two special cases are 2 and 6, for which one has to look a little beyound n2).

Robert Carmichael conjectured that Nϕ(n)=1 never. Two sequences in Sloane’s OEIS that list numbers with higher totient valences than preceding numbers are A007374 and A097942.

随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 10:39:40