N-smooth numbers: Difference between revisions
Content added Content deleted
| Line 622: | Line 622: | ||
def prime?(n) # P3 Prime Generator primality test |
def prime?(n) # P3 Prime Generator primality test |
||
return n | 1 == 3 if n < 5 # n: 2,3|true; 0,1,4|false |
return n | 1 == 3 if n < 5 # n: 2,3|true; 0,1,4|false |
||
return false if n.gcd(6) != 1 # |
return false if n.gcd(6) != 1 # this filters out 2/3 of all integers |
||
pc = typeof(n).new(5) # first P3 prime candidates sequence value |
pc = typeof(n).new(5) # first P3 prime candidates sequence value |
||
until pc*pc > n |
until pc*pc > n |
||