55 lines
853 B
Markdown
55 lines
853 B
Markdown
|
---
|
||
|
|
id: 5900f3b91000cf542c50fecc
|
||
|
|
title: 'Problem 77: Prime summations'
|
||
|
|
challengeType: 5
|
||
|
|
forumTopicId: 302190
|
||
|
|
dashedName: problem-77-prime-summations
|
||
|
|
---
|
||
|
|
|
||
|
|
# --description--
|
||
|
|
|
||
|
|
It is possible to write ten as the sum of primes in exactly five different ways:
|
||
|
|
|
||
|
|
<div style='margin-left: 4em;'>
|
||
|
|
7 + 3<br>
|
||
|
|
5 + 5<br>
|
||
|
|
5 + 3 + 2<br>
|
||
|
|
3 + 3 + 2 + 2<br>
|
||
|
|
2 + 2 + 2 + 2 + 2<br>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
What is the first value which can be written as the sum of primes in over five thousand different ways?
|
||
|
|
|
||
|
|
# --hints--
|
||
|
|
|
||
|
|
`primeSummations()` should return a number.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert(typeof primeSummations() === 'number');
|
||
|
|
```
|
||
|
|
|
||
|
|
`primeSummations()` should return 71.
|
||
|
|
|
||
|
|
```js
|
||
|
|
assert.strictEqual(primeSummations(), 71);
|
||
|
|
```
|
||
|
|
|
||
|
|
# --seed--
|
||
|
|
|
||
|
|
## --seed-contents--
|
||
|
|
|
||
|
|
```js
|
||
|
|
function primeSummations() {
|
||
|
|
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
primeSummations();
|
||
|
|
```
|
||
|
|
|
||
|
|
# --solutions--
|
||
|
|
|
||
|
|
```js
|
||
|
|
// solution required
|
||
|
|
```
|