---
id: 5900f4671000cf542c50ff79
challengeType: 5
title: 'Problem 249: Prime Subset Sums'
---

## Description
<section id='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.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler249()</code> should return 9275262564250418.
    testString: assert.strictEqual(euler249(), 9275262564250418, '<code>euler249()</code> should return 9275262564250418.');

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler249() {
  // Good luck!
  return true;
}

euler249();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>