Fixed bug in primeGenerator

Algorithms.py

@@ -45,7 +45,7 @@ def primeGenerator():
 		else:
 			#Move each witness to it's next multiple
 			for num in dict[possiblePrime]:
-				dict.setdefault(num + possiblePrime, []).append(num)
+				dict.setdefault(num + num + possiblePrime, []).append(num)
 			#We no longer need this, free the memory
 			del dict[possiblePrime]
 
@@ -78,6 +78,9 @@ def getPrimes(goalNumber: int) -> list:
 	while(primes[len(primes) - 1] < goalNumber):
 		primes.append(next(gen))
 
+	if(primes[len(primes)- 1] > goalNumber):
+		primes.pop()
+
 	return primes
 
 #This function gets a certain number of primes