搜索资源列表
fermat
- 实现素性检测。但不能实现太大的数，只能在小数范围内，而又不能完全确定就是素数，只能粗略估计。-achieve Primality Testing. But too few achieve, only in a minority within, and is not fully ascertained is the prime, only a rough estimate.
j-fermat
- 2007年robecode大赛亚军代码1!
DataSec
- VC++6.0实现快速、方便的费尔玛因子分解-Fermat of factor decomposition
1
- 原理类似伪费马小定理。 截尾减。 模拟人工判定 -Fermat' s principle of similar small theorem false. Censored minus. Analog manual to determine
Prime_Numbers
- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be beca
CreatePrime
- 采用费马定理生成大素数的C语言源代码，开发工具为Visual 2008-Fermat' s Theorem by generating large prime numbers C language source code
poj2420
- poj2420AC代码，采用变步长法求解多边形的费马点-The code for poj2420,which can be used to find the fermat point of a polygon by way of changing step.
4
- C源码：费尔马“二平方”素数,C源码：费尔马“二平方”素数-C source: Fermat " two square" primes, C Source: Fermat " two square" primes
0
- 给n个点，求费马点到各点的距离和 模拟退火-For n points, find Fermat point to the distance between the point and Simulated Annealing
fermat_test.py
- Fermat primality test. most applications use a Miller-Rabin or Baillie-PSW test for primality. Sometimes a Fermat test (along with some trial division by small primes) is performed first to improve performance. GMP since version 3.0 uses a base-210 F
format
- 费马小定理（包含生成随机数） 不足是大数测试不通过-Fermat s little theorem (including generating random numbers) Testing is not through lack of Tarsus