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

id, challengeType, title

id	challengeType	title
5900f4671000cf542c50ff79	5	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.

Instructions

Tests

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

Challenge Seed

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

euler249();

Solution

// solution required