文件名称:Prime_Numbers
- 所属分类:
- Windows编程
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 11kb
- 下载次数:
- 0次
- 提 供 者:
- kb***
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
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 because of the difficulty to prove that any given arbitrary number is prime. This is call the primality test. Most of the test for primality are probalistic rather than deterministic,because probalistic test are much more quicker than the deterministic ones. When testing the primality of a given number,one of the theorem that is very largely used is Fermat s little theorem: if "p" is a prime number that is not a factor of a given integer "a",then pow(a, p - 1) = 1 (mod p) or pow(a, p - 1) p = 1 One of the main application of prime numbers nowadays is chryptography,the RSA algorithm for encrypting and decrypting messages is based on 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 because of the difficulty to prove that any given arbitrary number is prime. This is call the primality test. Most of the test for primality are probalistic rather than deterministic,because probalistic test are much more quicker than the deterministic ones. When testing the primality of a given number,one of the theorem that is very largely used is Fermat s little theorem: if "p" is a prime number that is not a factor of a given integer "a",then pow(a, p- 1) = 1 (mod p) or pow(a, p- 1) p = 1 One of the main application of prime numbers nowadays is chryptography,the RSA algorithm for encrypting and decrypting messages is based on prime numbers.
相关搜索: fermat
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Prime Numbers
.............\Debug
.............\Prime Numbers.cpp
.............\Prime Numbers.dsp
.............\Prime Numbers.dsw
.............\Prime Numbers.ncb
.............\Prime Numbers.opt
.............\Prime Numbers.plg
.............\Debug
.............\Prime Numbers.cpp
.............\Prime Numbers.dsp
.............\Prime Numbers.dsw
.............\Prime Numbers.ncb
.............\Prime Numbers.opt
.............\Prime Numbers.plg