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.