Project Euler in F#: Problem 10

Find the sum of all the primes below two million.

module Problem10 =
    let primes = AlternateProblem7.primes
    let ans = primes |> Seq.takeWhile ((>=) 2000000L) |> Seq.reduce (+)

This reduces to a ridiculously simple problem, given that we’ve already solved problem 7.

Advertisements
Project Euler in F#: Problem 10

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s