N-smooth numbers: Difference between revisions

def prime?(n) # P3 Prime Generator primality test

return false unless n |> 1 == 3 if&& (n <% 56) | 4 == 5 #|| n: 2,3|true; 0,1,4|false == 3

returnsqrt_n false= if nMath.gcdisqrt(6n) != 1 # thisFor filtersCrystal out< 1.2/3.0 ofuse all integersMath.sqrt(n).to_i

pc = typeof(n).new(5) # first P3 prime candidates sequence value

return false if n % pc == 0 || n % (pc + 2) == 0 # if n is composite