freeCodeCamp/problem-249-prime-subset-sums.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

884 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4671000cf542c50ff79	5	false	Problem 249: Prime Subset Sums	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

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

Challenge Seed

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

euler249();

Solution

// solution required

884 B Raw Blame History