搜索资源列表
质数生成算法
- 质数生成算法的实现-prime number generation algorithm implementation
判断一个素数能被几个9整除
- 判断一个素数能被几个9整除-judgment can be a prime number nine divisible
Miller-Rabin_primality_test_(Java)
- Miller-Rabin Prime Number Test
java
- 一些java初学者适合的java源代码 里面有判断质数，判断月份的天数，进制转换等等好多有用的源代码 -Some beginners java source code for the java prime number which has to judge, to determine the number of days in January, hex conversion, and so a lot of useful source code
sushu
- 一个简单的用于判断素数的JAVA程序。简单易学！特别适合初学者！-A simple prime number used to judge the JAVA program. Easy to learn! Particularly suitable for beginners!
sspd
- 素数判断用Java程序写的Applet小程序 输入任意证书均可以判断是否是素数-Prime numbers to determine the procedures used to write the Java applet Applet arbitrary input can determine whether the certificate is a prime number
PrimeNumber
- //本代码用Java实现了素数类，第一个功能就是对你输入的数字进行判断是否是素数， //第二个功能就是你输入两个数（第二个数要大于第一个数），然后输出这两个数之间所有素数的个数 //以及这些素数之和。（初学者仅供参考）-Complete the class of prime number in Java.
sushu
- 判断是否是素数，计算一共有几个素数。并求出所有素数的和。-To determine whether a prime number, calculate a total number of primes. And to find all prime numbers and.
session1
- the code for prime number
phpreliazeRSA
- PHP实现RSA算法/* * Implementation of the RSA algorithm * (C) Copyright 2004 Edsko de Vries, Ireland * * Licensed under the GNU Public License (GPL) * * This implementation has been verified against [3] * (tested Java/PHP interoperability).
JAVAsushu
- 求100以内素数的JAVA程序，打印输出！-Demand within the prime number 100 JAVA program to print out!
Zyz
- 输入一个数 求出该数的质因子 采用先求因子 再判断是否为质数的方法 -Enter a number of prime factors of the number obtained using the first factor and then seek to determine whether the method for the prime number
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)
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
- 判断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?
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