3 private final int MAX = 100000;
\r
7 public static void main(String args[]) {
\r
9 System.out.println("# it starts");
\r
10 Test t = new Test();
\r
15 public void doSomeWork()
\r
18 long time = System.currentTimeMillis();
\r
20 //I did the for loop this way so that each parallel thread would take
\r
21 //about the same time
\r
22 for(int i = 0; i < MAX/2 + 1; i++)
\r
27 int oppositeNum = MAX - i;
\r
32 if(i != oppositeNum && isPrime(oppositeNum))
\r
33 innerSum += MAX - i;
\r
39 System.out.println("The sum of primes from 1 to " + MAX + " is " + sum + ".");
\r
40 System.out.println("Note: 1 is counted as a prime.");
\r
41 System.out.println("Time Consumed (Not Parallelized): " + (System.currentTimeMillis() - time) + " ms");
\r
46 private boolean isPrime(int number)
\r
48 //handles special cases
\r
55 //Tests the rest of the numbers
\r
56 for(int i = 2; i < number; i++)
\r