---
id: 5900f4671000cf542c50ff79
challengeType: 5
title: 'Problem 249: Prime Subset Sums'
forumTopicId: 301896
---
## Description
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.
## Instructions
## Tests
```yml
tests:
- text: euler249() should return 9275262564250418.
testString: assert.strictEqual(euler249(), 9275262564250418);
```
## Challenge Seed
```js
function euler249() {
// Good luck!
return true;
}
euler249();
```