搜索结果: 1-1 共查到“模糊数学 new characterization”相关记录1条 . 查询时间(0.43 秒)
A new characterization of Carmichael numbers via a generalization of Lehmer's totient problem
new characterization Carmichael numbers generalization of Lehmer's totient problem
2011/1/20
Lehmer’s totient problem consists of determining the set of positive integers n such that '(n)|n − 1 where ' is Euler’s totient function. Any such composite number is a Carmichael number.