This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Prime Subset Sums

Problem 249

Published on 13 June 2009 at 05:00 am [Server Time]

Let S = {2, 3, 5, ..., 4999} be the set of prime numbers less than 5000.

Find the number of subsets of S, the sum of whose elements is a prime number.
Enter the rightmost 16 digits as your answer.


Answer:
Go to back to Problems