搜索资源列表
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.
质数生成算法
- 质数生成算法的实现-prime number generation algorithm implementation
异常和线程
- 小程序不断地显示绿色的数字，每秒一个。如果数字是质数，小程序以红色显示。-small programs continue to show a green figure, one per second. If the figure is the number of quality, small programs to show red.
Prime.java
- 求简单的某整数范围内的质数之和-seeking a simple integer within hours, the quality and
LittlePrime
- 打印质数的Java源代码-few of the Java source code
136a
- 多个java程序，包括杨辉三角输出，银行储蓄模拟，质数寻找等
FindPrimes
- 这个程序是用来求出一定数量的质数的，但是用到了线程调度，是用java写的，可供参考。数量是用户自己输入的
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
zhishu
- 计算质数的优秀算法,时间快，耗费资源少等优点-Excellent algorithm for calculating prime numbers, time, speed, cost and fewer resources
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
primesToFile
- 搜索质数，并将其输出至文件，路径在程序中设置。-put primes to file
E
- 检测哥德巴赫猜想的代码，把一个大于等于6的偶数，分成两个奇质数的和！-Goldbach conjecture code detection, a greater than or equal to 6, even, into two odd primes!
DOS
- 质数判断，转速判断， 质数判断，转速判断， 质数判断，转速判断，-zhishu panduan，zhishu panduan，zhishu panduan，zhishu panduan，zhishu panduan，
javaxiaochenxu
- 阶乘、奇数和、日志、质数的一些介绍与程序代码-Factorial, odd and, logs, introduced a number of prime numbers and code
PrimeNumber
- 该代码实现了对任意实数判断是否为质数的功能-failed to translate
rib.java
- 判别指数,使得输入一个数判别是否可以分解为质数，并输出-choosing to figure
JavaApplication36
- java 求质数小程序 判断数字是否为质数 并给出判断-java seeking primes small program to determine whether the number is a prime number, and given the judgment
Java
- 资料里的是Java的程序代码，有求n个奇数的和，输出给定范围的质数，阶乘的计算，输出前五个被3整除的数，用非递归的方法打印Fibonacci数列。-Data is the Java code, n odd and output demand given the scope of the prime numbers, the factorial calculation output five divisible by 3, non-recursive print the Fibonacci seq
Goldbach-conjecture
- 歌德巴赫猜想,任何一个大于六的偶数可以拆分成两个质数的和 打印出所有的可能 -Goldbach conjecture that any even number greater than six can be split into two prime numbers and print out all possible
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