Project Euler – Problem # 10 – Solved with Go

Calculate the sum of all the primes below two million.

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million.

**********

When running this program on http://play.golang.org/, I get the error message [process took too long]; however, when running it on my local machine I get the correct answer.

One Possible Solution: Go

package main

import "fmt"
import "math"

var Sum int64 = 0

func main() {
	
	counter := 1
	for counter < 2000000 {
		if isPrime(counter) {
			Sum += int64(counter)
		}
		counter += 2
	}
	fmt.Println(Sum + 2)

}

func Sqrt(x float64) float64 {
	x = math.Sqrt(x)
	return x
}

func isPrime(n int) (isP bool) {
	if n == 1 {
		return false
	}
	if n == 2 {
		return true
	}
	k := int(Sqrt(float64(n)))
	for i := 2; i <= k; i++ {
		if n%i == 0 {
			return false
		}

	}
	return true

}
Advertisements

Project Euler – Problem # 10 – Solved with Java & Python

Calculate the sum of all the primes below two million.

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million.

One Possible Solution: Java

One Possible Solution: Python