This question doesn't support checking answers.
249. Prime Subset Sums

Publish Date:

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.

Press F12 and use the "Console" tab to view the output of your codes.

Loading...