Divide a number by numbers in a list.

[Gribouillis]

@deanhystad you forgot to write count = 0 in primes_e(). I ran the test, adding my own version (which is an infinite Eratosthene sieve) and here are the results:

Output:
n = 100
Modulo           sum =       1060  count =       1133  time = 0.00014
Optimized mod    sum =       1060  count =        136  time = 0.00005
Eratosthenes     sum =       1060  count =         94  time = 0.00002
Gribouillis      sum =       1060  count =        129  time = 0.00008

n = 1000
Modulo           sum =      76127  count =      78022  time = 0.00776
Optimized mod    sum =      76127  count =       2850  time = 0.00041
Eratosthenes     sum =      76127  count =       1200  time = 0.00019
Gribouillis      sum =      76127  count =       1593  time = 0.00099

n = 10000
Modulo           sum =    5736396  count =    5775223  time = 0.49709
Optimized mod    sum =    5736396  count =      60957  time = 0.00593
Eratosthenes     sum =    5736396  count =      13833  time = 0.00159
Gribouillis      sum =    5736396  count =      18222  time = 0.01214

n = 100000
Modulo           sum =  454396537  count =  455189150  time = 40.08849
Optimized mod    sum =  454396537  count =    1395441  time = 0.12196
Eratosthenes     sum =  454396537  count =     151854  time = 0.01847
Gribouillis      sum =  454396537  count =     202674  time = 0.16963