FTS + numbertheory   47

Integer factorization
https://stackoverflow.com/q/6800193 most efficient way of finding all the factors of a number in Python?
numberTheory 
september 2017 by FTS
Lame定理
Lame定理:"如果欧几里得算法需要K步计算出一对整数的GCD,那么这对数中较小的那个数必然大于或者等于第k个fibonacci数"
numberTheory 
december 2013 by FTS

Copy this bookmark:



description:


tags: