math/prime_test.py about algorithms HOT 4 CLOSED

Well, by looking quickly to the source, it is obvious that the algorithm is false. The most basic fix is to add n % 5 == 0 in line 11, but i bet i would not be sufficient.

The following code seems to work better:

if n <= 1: return False
for i in range(2, 1 + int(math.sqrt(n))):
    if n % i == 0: return False
return True

from algorithms.

Also returns true for 25

from algorithms.

@Aluriak could you please push the fix.

from algorithms.

This has been fixed and pull request has been merged.

from algorithms.