Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,844 questions

51,765 answers

573 users

How to find the sum of all the primes below 10000 (ten thousand) in Scala

1 Answer

0 votes
object PrimeSum {
  def isPrime(n: Int): Boolean = {
    if (n < 2 || (n % 2 == 0 && n != 2)) return false
    val limit = math.sqrt(n).toInt
    for (i <- 3 to limit by 2) {
      if (n % i == 0) return false
    }
    true
  }

  def main(args: Array[String]): Unit = {
    val num = 10000
    val primes = for (i <- 2 until num if isPrime(i)) yield i
    val sum = primes.sum
    println(s"sum = $sum")
  }
}




/*
run:
 
sum = 5736396
 
*/

 



answered Jul 26, 2025 by avibootz
...