Sum of every prime number below n
Created on Jan. 16, 2017 by Julien Palard
Write a sum_primes
function returning the sum
of every prime
number strictly inferior to its single parameter.
Example
1 2 |
|
Advice
You may copy/paste your is_prime
function from a previous exercise ;)