67de105117
* fix: clean-up Project Euler 241-260 * fix: typo * Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-255-rounded-square-roots.md Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
684 B
684 B
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, \ldots, 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--
primeSubsetSums() should return 9275262564250418.
assert.strictEqual(primeSubsetSums(), 9275262564250418);
--seed--
--seed-contents--
function primeSubsetSums() {
return true;
}
primeSubsetSums();
--solutions--
// solution required