Searched refs:gapSize (Results 1 – 1 of 1) sorted by relevance
89 int gapSize = 1024; // for searching of the next probable prime number in nextProbablePrime() local91 boolean isDivisible[] = new boolean[gapSize]; in nextProbablePrime()116 modules[i] = BigInt.remainderByPositiveInt(startPoint, primes[i]) - gapSize; in nextProbablePrime()124 modules[i] = (modules[i] + gapSize) % primes[i]; in nextProbablePrime()126 for (; j < gapSize; j += primes[i]) { in nextProbablePrime()132 for (j = 0; j < gapSize; j++) { in nextProbablePrime()141 startPoint.addPositiveInt(gapSize); in nextProbablePrime()