Source

euler / go / src / euler / 10.go

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

Find the sum of all the primes below two million.

Answer: 142913828922
*/

package main

import (
	"fmt"
	"math/big"
)

func e10() {
	sum := int64(0)
	for i := int64(0); i < 2000000; i++ {
		if big.NewInt(i).ProbablyPrime(10) {
			sum += i
		}
	}
	fmt.Println(sum)
}

func init() {
    register("10", e10)
}

func init() {
    register("10", e10)
}
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.