The Problem
Sum the primes below 2 million.
The Solution
We already wrote a function to generate primes below a certain number for Problem 3.
We can just use Seq.sum
to sum those and we’re done.
getPrimesBelow64 2000000
|> Seq.sum
Sum the primes below 2 million.
We already wrote a function to generate primes below a certain number for Problem 3.
We can just use Seq.sum
to sum those and we’re done.
getPrimesBelow64 2000000
|> Seq.sum