This is a one-liner if you have a function that can identify primes.

Project Euler problem number 10 - Summation of primes - is stated as follows. The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million.

```
#![feature(iterator_step_by)]
fn is_prime(n: u64) -> bool {
if n == 2 || n == 3 {
return true;
} else if (n < 2) || (n % 2 == 0) {
return false;
}
let upper_limit = (n as f64).sqrt() as u64;
(3..upper_limit + 1)
.step_by(2)
.find(|i| n % i == 0)
.is_none()
}
fn sum_primes_below(n: u64) -> u64 {
(0..n).filter(|x| is_prime(*x)).sum()
}
fn main() {
let n = 2_000_000;
let sum = sum_primes_below(n);
println!("The Sum of the first {} primes is {}.", n, sum);
}
```

- [animation] Unknown Pleasures
- [tech-test] What is a binary tree and how to invert it using Kotlin
- [project-euler] Find Highly Divisible Triangular Numbers with Kotlin
- [project-euler] Find the Largest Product in a Grid with Rust
- [project-euler] Summation of the First Two Million Primes with Rust
- [project-euler] Finding the largest product in a series with Rust
- [project-euler] Finding the 10001st prime with Rust
- [js] The complete list of rational numbers with Stern-Brocot and Javascript
- [project-euler] Project Euler number six solved with Rust
- [project-euler] Smallest positive number that is evenly divisible by all of the numbers from 1 to 20 with Rust
- [project-euler] Finding the largest palindrome product with Rust
- [project-euler] Get the largest prime factor with Reason
- [project-euler] Find the sum of all even Fibonacci numbers below four million with OCaml
- [project-euler] Finding the sum of all multiples of 3 or 5 below 1000 with OCaml
- [project-euler] Special Pythagorean Triplet solved with Reason
- [personal] New Year's Resolution 2018