Cody

Problem 44793. Project Euler 249: Prime Subset Sums

Solution 2162838

Submitted on 17 Mar 2020 by David Hill
  • Size: 47
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
tic; SUM = euler249(10) toc; assert(isequal(SUM, uint64(7)))

SUM = uint64 7 Elapsed time is 0.005387 seconds.

2   Pass
tic; SUM = euler249(100) toc; assert(isequal(SUM, uint64(5253640)))

SUM = uint64 5253640 Elapsed time is 0.000244 seconds.

3   Pass
tic; SUM = euler249(1000) toc; assert(isequal(SUM, uint64(5725053962252706)))

SUM = uint64 5725053962252706 Elapsed time is 0.000229 seconds.

4   Pass
tic; SUM = euler249(2000) toc; assert(isequal(SUM, uint64(9536598422264105)))

SUM = uint64 9536598422264105 Elapsed time is 0.002776 seconds.

5   Pass
tic; SUM = euler249(4900) toc; assert(isequal(SUM, uint64(2455225028344813)))

SUM = uint64 2455225028344813 Elapsed time is 0.000977 seconds.

Suggested Problems

More from this Author4

Community Treasure Hunt

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

Start Hunting!