gistfile1.scala

package proj_euler

object Problem10 {
    def solve() : Long = {
        var sum : Long = 0
        var n = 2
        while (n < 2000000){
        if (is_prime(n) == true)
        {
            sum += n
            n = n + 1
        }
        else
            n = n + 1
        }
        return sum
    }
   
    def is_prime(n: Int) : Boolean ={
        if (n == 2 || n == 3)
            true
        else {
           var d = 2
           var div = n / 2
           while (d <= div){
               if (n % d == 0)
                   return false
               else
            	   d = d + 1
            }
       }
       return true
    }
}