How to find and calculate prime numbers
public class Main {
private final int UPPER_LIMIT = 10000;
public void calculatePrimeNumbers() {
int i = 0;
int primeNumberCounter = 0;
while (++i <= UPPER_LIMIT) {
int i1 = (int) Math.ceil(Math.sqrt(i));
boolean isPrimeNumber = false;
while (i1 > 1) {
if ((i != i1) && (i % i1 == 0)) {
isPrimeNumber = false;
break;
} else if (!isPrimeNumber) {
isPrimeNumber = true;
}
--i1;
}
if (isPrimeNumber) {
System.out.println(i);
++primeNumberCounter;
}
}
System.out.println("Nr of prime numbers found: " + primeNumberCounter);
}
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
new Main().calculatePrimeNumbers();
}
}
The result when running the program looks something like this:
2
3
5
7
11
13
17
19
23
29
...
...
...
9907
9923
9929
9931
9941
9949
9967
9973
0 comments: