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.
320 Solvers
134 Solvers
Matrix with different incremental runs
91 Solvers
159 Solvers
1078 Solvers
Tags