Java 程序打印 100 以下的素数
java programming java8object oriented programming
任何大于 1 且只有两个因数(1 和该数本身)的整数称为素数。除这两个因数外，该数没有正因数。例如 −
7 = 1 × 7
一些素数是 − 1、2、3、5、7、11 等。
算法
- 1. 取整数变量 A
- 2. 用变量 A 除以 (A-1 到 2)
- 3. 如果 A 不能被任何值(A-1 到 2)整除，除了它本身，它就是素数。
- 4.对从 2 开始直到所需限制的所有数字重复此操作。
示例
public class First100Primes {
public static void main(String args[]){
for(int i = 2; i<=100;){
int prime = 1;
for(int loop = 2; loop <=i; loop++) {
if((i % loop) == 0 && loop!=i) {
prime = 0;
}
}
if (prime != 0){
System.out.println(i+" is a prime number");
i++;
}
else
i ++;
}
}
}
输出
2 is a prime number 3 is a prime number 5 is a prime number 7 is a prime number 11 is a prime number 13 is a prime number 17 is a prime number 19 is a prime number 23 is a prime number 29 is a prime number 31 is a prime number 37 is a prime number 41 is a prime number 43 is a prime number 47 is a prime number 53 is a prime number 59 is a prime number 61 is a prime number 67 is a prime number 71 is a prime number 73 is a prime number 79 is a prime number 83 is a prime number 89 is a prime number 97 is a prime number
