private boolean isPrime(long pNumber){
		boolean check = false;
		long n = pNumber;
		for (int i = 0; primes.get(i) <= n/2; i++) {
			if(i > Math.sqrt(n)){
				break;
			}
			while (n % primes.get(i) == 0) {
				n /= primes.get(i);
				break;
			}
		}
		if(pNumber == n){
			check = true;
		}
	
		return check;
	}