搜索资源列表
Sieve
- Sieve算法实例，找质数的算法，找出2到x之间的所有质数的算法-Sieve algorithm instance, the algorithm to find prime numbers, from 2 to identify all the prime numbers between x algorithm
4give-all-primes
- 由读者自行给出人一个数据，则输出这一范围内的所有质数。-To give all primes as a output if you give specified number.
test
- 实现查找大于某个数的最小质数，只需要实现输入这个数-Find more than a few to achieve the smallest prime number
Eratoshenes
- eratoshenes素数筛选，本源码是通过标记数组下标来记录1000以内的质数-eratoshenes prime filter, the source is through the tag array subscr ipt to record prime number those are less than 1000
Calculate-prime-number-less-than-100
- 计算100以内的质数 计算100以内的质数 -Calculate prime number less than 100
zhishu
- 改进的递归算法，输出100以内的质数，VB.NET程序。通过已经得到的质数，算出下一个质数。-output the prime number within 100 Using improved recursion algorithm, the programe is coded with vb.net. Through got prime, calculate the next prime Numbers.
zhishu
- 打印质数的各种算法，首先介绍了教科书上的实现方法，然后从减小时间复杂度的方向出发，介绍了几种打印质数的算法，C++实现。-The number of print quality algorithm, first introduced on the implementation of textbooks, then reduce the time complexity from the direction, describes several printing prime numbers algo
prime
- 这个程序给出4到100000000中所有的偶数都是可以由两个质数的和。-This program will solute a problem every even number can be a sum of two prime numbers.
CPP
- 利用Visual C++可视化编程环境来实现矩阵的转置、计数器的编写、质数的计算等功能。-Visual C++ using visual programming environment to implement the matrix transpose, the counter written, the calculation of the number of quality features
zhisu
- 本程序通过用户输入范围而求出范围内所有的质数-The scope of this program through the user input to derive all the prime numbers within the range
MathTools2
- android下的数学工具，其中含有质数计算器，-android under the mathematical tools, which contains a prime number calculator,
for
- 歌德巴赫猜想,任何一个大于六的偶数可以拆分成两个质数的和 打印出所有的可能 //任何一个大于六的偶数可以拆分成两个质数的和 //打印出所有的可能 -Goldbach conjecture, any even number greater than six can be split into two prime numbers and print out all possible// any even number greater than six can be split
creatchildprocess
- 计算某个数字上限内的所有质数,数字限于正整数-calculate all prime numbers smaller than input number
Prime
- JAVA多线程找质数。 输入为你想要创建的线程数和质数上限。 例： java PrimeSieve 10 3会利用三个线程输出10以下所有的质数-JAVA multi-threading to find prime numbers. Enter the number of threads you want to create the maximum number and quality. Example: java PrimeSieve 10 3 will make use of
C
- 求质数，牛顿迭代法，最大字符串，输出钻石字符串，比较字符串的大小-prime，string，diamond string
primes50
- 产生大质数的算法，可以很好地研究密码学领域和数论领域的知识~ -The algorithm generates a large prime number, can be a good field of cryptography and number theory research knowledge in the field- have a large prime number algorithm, can be a good field of cryptography and number t
fenjie
- 里面描述了将一个数分解成若干个质数的乘积的形式的算法，很简洁，希望能给大家一点儿启发。-it describes the split method of a data to a series .
zhi-yin-shu-fen-jie
- 一个能把输入的数字分解为几个质数相乘的程序（此为源码）-Enter the number of prime numbers multiplied into several programs (this is the source files)
PRIMES
- 输入2个整数，找出这两个整数中的所有质数-input a and b , find all primes between a and b
613
- 从文档中读入一个数字，判断这个给定的数字是否是质数。-judge wether a number is a prime number