//
// program to find and print primes using sieve of Erastosthenes
//
println("enter limit value")
val limit = readInt

var isPrime = Array.fill(limit)(true)

for (n <- 2 until math.ceil(math.sqrt(limit)).toInt) {
  if (isPrime(n)) {
    // cross out multiples of n
    for (m <- 2*n until limit by n) {
      isPrime(m) = false
    }
  }
}

println("primes less than " + limit + ":")
for (m <- 2 until limit) {
  if (isPrime(m)) println(m)
}