Project Euler/249
From charlesreid1
Problem Statement
Prime Subset Sums
Let S = {2, 3, 5, ..., 4999} be the set of primes less than 5000.
Find the number of subsets of S whose sum is a prime number.
Enter the rightmost 16 digits of your answer.
Flags