RosettaCodeData/Task/Primality-by-trial-division/FunL/primality-by-trial-division.funl
2016-12-05 23:44:36 +01:00

9 lines
212 B
Text

import math.sqrt
def
isPrime( 2 ) = true
isPrime( n )
| n < 3 or 2|n = false
| otherwise = (3..int(sqrt(n)) by 2).forall( (/|n) )
(10^10..10^10+50).filter( isPrime ).foreach( println )