搜索资源列表
qiusushu
- 求任意自然数中素数的和，可以校验输入的数是否自然数，并显示出所有素数-seeking arbitrary natural number which primes and can check whether the number of imported natural number, and demonstrated that all prime numbers
PrimeNum
- PrimeNum程序描述： 本程序包括：找100～200间的素数 主要是记住找素数的算法-PrimeNum procedures Descr iption : The procedures include : find 100 ~ 200 of the Primes is mainly remembered for a number of algorithm -
A Prime Number Generator
- 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 becau
poj3143.rar
- poj 3143 验证“歌德巴赫猜想”，即：任意一个大于等于6的偶数均可表示成两个素数之和。 http://poj.grids.cn/problem?id=3143 可直接运行,poj 3143 authentication " Goldbach Conjecture" , namely: any even number greater than or equal to 6 can be expressed as the sum of two primes. http://poj
win32
- 使用win32线程库实现的多线程求解素数程序，输入素数即可求得小于该素数的所有素数-Using the win32 thread library implementation of multi-threaded prime number solver program, enter the prime numbers less than the prime number can be obtained for all primes
14
- 算法功能：输入一个正整数，若其是素数，将其输出，否则，找出与其最邻近的素数，并输出这个素数。-Algorithm functions: enter a positive integer, if it is a prime number, output, otherwise identify their nearest prime number, and outputs the primes.
A_Proof_Of_Goldbach_Conjecture
- 在本文件中，哥德巴赫猜想（ 1 ， 1 ） ，证明了复变 一体化。为了证明这猜想，一个新的功能引入Dirichlet级数。 然后，用门阶公式的Dirichlet级数和留数定理，我们 得出这样的结论：任何较大甚至整数可表示为两个素数之和。-In this paper, the Goldbach Conjecture﹛1, 1﹜ is proved by the complex variable integration. To prove the conjecture,
source259
- 因特网梅森素数大搜索，多处理器版v25.9-Great Internet Mersenne Prime Search GIMPS Finding World Record Primes Since 1996
yanz
- 验证哥德巴赫猜想：任何大于5的偶数均可分解为两个素数之和。-Verify Goldbach conjecture: any even number greater than 5 can be decomposed into the sum of two primes.
lab4.c.tar
- Search for primes using MPI-Search for primes using MPI
Primzahlen_0-1
- Example of automated Primes generation using up to date algorithms
primes50
- List of Primes (10 millions)
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
prime
- 查找任意大于>=2的自然数以内的的素数，这是用vc++ win32控制台程序编写。-Find any more than> = 2 the natural number of primes less than it is to use vc++ win32 console programming.
4give-all-primes
- 由读者自行给出人一个数据，则输出这一范围内的所有质数。-To give all primes as a output if you give specified number.
PRIMES
- 输入2个整数，找出这两个整数中的所有质数-input a and b , find all primes between a and b
Seeking-primes-
- 如果从2-30中的素数，然后将筛中的最小数2作为素数，并把2的倍数都 从筛中取走。这样，第一步以后，筛子中还剩下2和2－30所有奇数。重复上述步骤，在筛中保留的数中保留的数中即将小数3作为素数，并从筛中取走3的倍数。反复重复上述步骤，直到筛听素数7大于30的平方根结束。-Primes from 2-30, and then sieve the minimum number of 2 as a prime number, and the multiple of 2 are removed from
primes
- 找出100 到200之间的所有的质数，并且能够在form中打印！-Find all between 100-200 primes, and the ability to print in form!
4give-all-primes
- 由读者自行给出人一个数据，则输出这一范围内的所有质数。-To give all primes as a output if you give specified number.