Files
gikf 67de105117 fix(curriculum): clean-up Project Euler 241-260 (#42879)
* 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>
2021-07-16 12:21:45 +02:00

43 lines
684 B
Markdown

---
id: 5900f4671000cf542c50ff79
title: 'Problem 249: Prime Subset Sums'
challengeType: 5
forumTopicId: 301896
dashedName: 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`.
```js
assert.strictEqual(primeSubsetSums(), 9275262564250418);
```
# --seed--
## --seed-contents--
```js
function primeSubsetSums() {
return true;
}
primeSubsetSums();
```
# --solutions--
```js
// solution required
```