用java求2到100之间的素数
以下是用Java编写的求2到100之间的素数的代码:
public class PrimeNumbers {
public static void main(String[] args) {
int start = 2;
int end = 100;
System.out.println("Prime numbers between " + start + " and " + end + " are:");
for (int i = start; i <= end; i++) {
if (isPrime(i)) {
System.out.println(i);
}
}
}
public static boolean isPrime(int number) {
if (number <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(number); i++) {
if (number % i == 0) {
return false;
}
}
return true;
}
}
输出结果为:
Prime numbers between 2 and 100 are:
2
3
5
7
11
13
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
``
原文地址: https://www.cveoy.top/t/topic/hDB7 著作权归作者所有。请勿转载和采集!