Inspired by Project Euler n°10 (I am quite obviously a fan).
With problem n°250 by Doug, you can find some global methods to compute the sum of all the primes below the input n.
For example, the sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
But how to proceed (in time) with big number and WITHOUT the primes function ?
HINTS: sum(primes(n)) is possible here but why miss the wonderfull Sieve of Eratosthenes ?
12859 Solvers
Which values occur exactly three times?
3118 Solvers
1066 Solvers
Generate N equally spaced intervals between -L and L
387 Solvers
Cell Counting: How Many Draws?
190 Solvers
Solution 447945
This doesn't use primes(x),but still feels a little like cheating.