Problem Statement

Write a boolean function that tells whether a given integer is prime.

Remember that   1   and all non-positive numbers are not prime. Use trial division. Even numbers greater than   2   may be eliminated right away. A loop from   3   to   √ n    will suffice,   but other loops are allowed.

Let's start with the solution:

fun prime(p) type integer->integer
  p.gt(1) where q=p.sqrt NO(p.mod(2..q)==0)

1..100.prime