搜索结果: 1-2 共查到“模糊数学 numbers”相关记录2条 . 查询时间(0.362 秒)
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.
Generalized Fibonacci Numbers and Blackwell's Renewal Theorem
generalized Fibonacci numbers renewal theory
2011/2/25
We investigate a connection between generalized Fibonacci numbers and renewal theory for stochastic processes. Using Blackwell’s renewal theorem we find an approximation to the generalized Fibonacci n...