private void findSumOfPrimes(long start, long boundary){
		long sum = 2;
		for (long i = start; i <= boundary; i=i+2){
//			System.out.println("i: " + i);
			//long startTime = System.currentTimeMillis();
			if(isPrime(i)){
				sum = sum + i;
			}
//			if(isPrime(i+2)){
//				sum = sum + (i+2);
//			}
			//System.out.println("Prime check in: " + (System.currentTimeMillis()-startTime));
		}
		System.out.println(sum);
	}