求素数
public class PrimeNumbers {
public static void main(String[] args) {
int n = 100; // 可以修改这里来找出更大或更小的素数
System.out.println("Prime numbers up to " + n + " are:");
for (int i = 2; i <= n; i++) {
if (isPrime(i)) {
System.out.print(i + " ");
}
}
}
public static boolean isPrime(int num) {
if (num <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
}