prime.java

	private boolean isPrime(int number){
		for (int i = 2; i <= Math.sqrt(number); i++) {
			if (number%i==0) {
				return false;
			}
		}
		return true;
	}

	private int getPrimeNumber(int number) {

		if (number%2== 0) {
			number+=1;
		}
		while (!isPrime(number)) {
			number+=2;
			
		}
		return number;
	}