Return to Answer

Simplified code

edited Jun 15, 2015 at 15:07

258.7k
21
370
830

This is bit faster:

toPrime = 500; sums = Accumulate@FoldList[#1 #2 &Accumulate@FoldList[Times, 1, Range[2, Prime@toPrime - 1]]; primes = Prime[Range[toPrime]]; Mod[sums[[primes - 1]], primes]

Precompute factorial sums and primes. Mod is fast on lists.

This is bit faster:

toPrime = 500; sums = Accumulate@FoldList[#1 #2 &, 1, Range[2, Prime@toPrime - 1]]; primes = Prime[Range[toPrime]]; Mod[sums[[primes - 1]], primes]

Precompute factorial sums and primes. Mod is fast on lists.

This is bit faster:

toPrime = 500; sums = Accumulate@FoldList[Times, 1, Range[2, Prime@toPrime - 1]]; primes = Prime[Range[toPrime]]; Mod[sums[[primes - 1]], primes]

Precompute factorial sums and primes. Mod is fast on lists.

Source Link

answered Mar 26, 2013 at 5:41

Michael E2

258.7k
21
370
830

This is bit faster:

toPrime = 500; sums = Accumulate@FoldList[#1 #2 &, 1, Range[2, Prime@toPrime - 1]]; primes = Prime[Range[toPrime]]; Mod[sums[[primes - 1]], primes]

Precompute factorial sums and primes. Mod is fast on lists.