freeCodeCamp/curriculum/challenges/italian/10-coding-interview-prep/project-euler/problem-249-prime-subset-sums.md

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f4671000cf542c50ff79	Problem 249: Prime Subset Sums	5	301896	problem-249-prime-subset-sums

--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.

--hints--

euler249() should return 9275262564250418.

assert.strictEqual(euler249(), 9275262564250418);

--seed--

--seed-contents--

function euler249() {

  return true;
}

euler249();

--solutions--

// solution required