Inspired by Problem 249 of Project Euler. https://projecteuler.net/problem=249
Let S = {2, 3, 5, ...} be the set of prime numbers less than N.
Find the number of subsets of S, the sum of whose elements is a prime number. Enter the rightmost 16 digits as your answer. The answer must be a uint64 integer.
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers24
Suggested Problems
-
362 Solvers
-
Make a random, non-repeating vector.
11941 Solvers
-
Circular Primes (based on Project Euler, problem 35)
662 Solvers
-
495 Solvers
-
compress sequence into intervals
100 Solvers
More from this Author4
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The tip for this one is that It is possible to solve it within MATLAB's precision by using mod(x,10^16). No need for Java or Python (arbitrary-precision arithmetic).
At least those four lookup solutions inspired me to squeeze a bit harder to get down to 61.