搜索资源列表
primzahl
- 这是一个判断一个数是不是质数的小程序.就是在applet上输入一个数,输出会告诉你这个数是不是质数.-This is a judgment of a few quality is not the number of small programs. The applet is on the importation of a few, output will tell you this number is not prime.
验证歌德巴赫猜想实验
- 验证歌德巴赫猜想 （1）：任何大于6的偶数都可以表示为两个素数之和：如8=5+3 （2）：任何大于5的奇数都可以表示为三个素数之和：如：11=3+3+5-certification Goldbach conjecture (1) : any of the even greater than 6 can be expressed as two prime numbers and : 800 = 5 3 (2) : No more than five odd numbers can be e
sushu12312
- 编写程序，打印出1-100之间的素数，要求每行显示5个数据(可以用continue或break来做)； -programming, print 1-100 between the prime, every five lines of data (or can continue to do break);
C++PRIMEbooksource
- C++ PRIME书中的原代码,看本书时可以学习的例子.-C source code in the book, looking at the book can learn from the example.
manyPrimeThrea
- 使用多线程技术计算100000之间的所有素数的个数，java程序-use multithreading technology between 100,000 calculation of all the prime numbers, java procedures
PrimeNumbers
- this algorithm is about prime numbers
prime
- 筛选法搜索所有素数，范围是1~1000,由于除法效率很低，故使用筛选法，适合初学者学习-Screening search all prime numbers, the scope of 1 ~ 1000, due to inefficient division, so the use of screening, suitable for beginners to learn
Prime
- 验证哥德巴赫猜想，此程序为java大学实验-prime
prime
- it is a RMI system which check if the number is prime or not prime(the number which the client send it)it is a RMI system which check if the number is prime or not prime(the number which the client send it)
prime-factor
- 读入一个整数，显示它的所有的素数因子。例如，读入120，输出2,2,2,3,5-Read an integer, it shows all the prime factors. For example, read 120, the output 2,2,2,3,5
prime
- Prime算法求解最小生成树的java呈现-prime mst
Large-prime
- 在密码学中，大素数分解是一个难题，同样大素数的生成在素性检测中也是一个难点，本文主要围绕这个中心点展开-In cryptography, a large prime number decomposition is a problem, as the generation of large prime numbers primality testing is also in a difficult, this paper started around this central point
Prime
- 个人原创代码：编写Java Application程序，高效输出100以内的所有素数。-The original code of the individual: write Java Application procedures, efficient output of less than 100 prime numbers.
prime
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 */ -Determine 101-200 between the number of primes, and output of all primes. A program analysis: judgment Primes: respectively removed by a number of 2 to s
random-integer-is-a-prime-number
- 判断随机整数是否是素数 产生100个0-999之间的随机整数，然后判断这100个随机整数哪些是素数，哪些不是？ -Determine whether random integer is a prime number generator 100 random integer between 0-999, and then determine which 100 random integers which are prime and which are not?
To-determine-the-prime-numbers
- 判断101-200之间有多少个素数，并输出所有素数。-Between 101-200 judge how many prime numbers, and outputs all primes.
Prime
- 特别简单的方法求100到200内的素数！-A perfect method for finding the prime number between 100 to 200
prime
- USACO1.5寻找两个数字之间的回文数且是质数的数Prime Palindromes，例如151是回文数也是质数-The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes
Determine-whether-a-number-is-prime
- 利用JAVA编写程序，用来判断一个自然数是不是素数的。-The use of JAVA programming, used to determine a natural number is not a prime number.
Prime-
- VB code for prime number