搜索资源列表
proot
- 求原跟的VC程序,可计算2-10000之间的质数的原跟-original request with the VC process, translate between 2-10000 the quality of the original with a few
getnum
- 求任意范围的素数（质数），应由各大企业单位面试多出此题，所以在此提供精简源码，不妨您面试前看看。
ZhiShu
- 采用筛选法求指定范围内的质数，并验证哥德巴赫猜想
2-8
- 在9（3*3）个方格的方阵中填入数字1到N(N>=10)内的某9个数字 每个方格填一个整数，要求相邻两个方格的两个整数之和为质数。 试求所有的解-in 9 (3 * 3) grid matrix to fill out a number of N (Ngt; = 10) of a nine figures each box filled an integral require two adjacent box at the two integral to the quality and n
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
qzs
- 一个用VB编的求质数的程序，有源代码，可以计算出任何一个整数以内的质数。-The number of procedures for quality
buyongkaifangqiuzhishu
- 突然想到不用开方求质数的方法，所以用visual basic实现。-Suddenly thought of seeking prime numbers do not prescribe the method, so using visual basic to achieve.
qiuzhishu
- 这个程序能求出求出一到所输入数值之间的所有质数！-This program can find the find the one entered into between the value of all prime numbers!
pipelinesample
- 流水线求质数的简单例子 终结的策略是由最后的processor 去发出结束信号-a pipleline mip program calculating required number of prime numbers
MyProjects
- 求平均数，求最大公约数，判断奇偶性，判断完全数，判断是否为质数-Average demand, find the common denominator, determine the parity, total number of judgments, to determine whether a prime number
mingzi
- 求100以内的质数算法，实现快速找质数，简洁易懂-The prime algorithm within 100
C
- 求质数，牛顿迭代法，最大字符串，输出钻石字符串，比较字符串的大小-prime，string，diamond string
1yi
- 快速求一亿以上的质数 求两个一亿以上的质数,相加还是质数的数 -Quick seeking a number of quality for more than one billion one million more than even a prime number, the sum is a prime number ...
Screening-find-prime-numbers
- 除了自身之外，无法被其它整数整除的数称之为质数，要求质数很简单，但如何快速的 求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的Eratosthenes求质 数方法。-In addition to outside itself, can not be called an integer divisible by the number of other primes, prime requirement is very simple, but how fast Fi
15
- c语言入门，数组的应用，利用数组求前n个质数,通过数组处理数学问题- c language portal, application of the array, use an array of the first n primes seeking to deal with an array of mathematical problems by
dearNumber
- 寻找10亿以内的拟亲和数，包括线性筛法求质数表、合数表，还有一些该算法实现技巧-For quasi amicable numbers less than 1000000000, including linear sieve method for prime number table, table, there are still some of the algorithm implementation skills
getPrimeNumber
- 非常快的求质数算法，百万数据在毫秒之间。以牺牲空间换取时间代价。-Very fast primes seeking algorithms, millions of data in milliseconds. At the expense of space for time costs.