Simple Prime Numbers Groovy Script

primesScript.groovy

#!/usr/bin/env groovy

public class PrimeNumberEvaluator {

// Evaluates a number looking if its prime or not
  static boolean isPrime( def number ){
    def divisors = []
    for( def possibleDivisor in (1..number) ){
      if( (number % possibleDivisor) == 0 ){ divisors << possibleDivisor }
      if( divisors.size() > 2 ){ break }
    }

    return divisors.size() <= 2
  }

  static def rangePrimes( def initialNumber, def finalNumber ){ 
    def primes = []
    for( def possiblePrime in (initialNumber..finalNumber) ){  
      if( isPrime( possiblePrime ) )  primes << possiblePrime
    }

    return primes
  }
}


println PrimeNumberEvaluator.isPrime( 2 )
println PrimeNumberEvaluator.isPrime( 12 )
println PrimeNumberEvaluator.isPrime( 5 )

println PrimeNumberEvaluator.rangePrimes( 2, 10000 )

One could write isPrime a bit simpler:

def isPrime(i) { (2..Math.sqrt(i)).every { i % it != 0 } }