euler problem 7

p007.scala

import scala.language.implicitConversions
import scala.language.postfixOps

class Prime(val i: Int) {
  def isPrime = {
    if (i <= 1) false
    else if (i == 2) true
    else { !(2 to (i-1)).exists(i % _ == 0)}
  }
}

implicit def intWrapper(i: Int) : Prime = new Prime(i)

def loop(num: Int, count: Int, target:Int): Int = {
  num match {
    case n if (n isPrime) && count == target - 1 => num
    case n if n isPrime => loop(n + 1, count + 1, target)
    case _ => loop(num + 1, count, target)
  }
}

println( loop(2, 0, 10001) ) // 104743