public int nextPrime() {
int number = -1;
for(int i=currentPrime+1; i<limit; i++) {
	if(isPrime(i) == true) {
		number = i;
		return number;
	}
}
return number;
}