Technically was a bug in 3
This commit is contained in:
@@ -19,7 +19,7 @@ def getNextPrime(ps):
|
|||||||
return [2]
|
return [2]
|
||||||
else:
|
else:
|
||||||
p = ps[-1] + 1
|
p = ps[-1] + 1
|
||||||
while isDivisible(p, [q for q in ps if q < np.sqrt(p)]):
|
while isDivisible(p, [q for q in ps if q <= np.sqrt(p)]):
|
||||||
p = p + 1
|
p = p + 1
|
||||||
ps.append(p)
|
ps.append(p)
|
||||||
return ps
|
return ps
|
||||||
|
|||||||
Reference in New Issue
Block a user