Problem 2337. Sum of big primes without primes

Difficulty:Rate

Solution 447945

Submitted on 30 May 2014 by Jon

This solution is locked. To view this solution, you need to solve the problem first.

Jon on 30 May 2014

This doesn't use primes(x),but still feels a little like cheating.

Rafael S.T. Vieira on 8 Aug 2020

The whole point of using the sieve is not knowing which numbers are prime. So it is no different than sum(primes).

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!