56 lines
1010 B
Markdown
56 lines
1010 B
Markdown
---
|
|
id: 5900f4671000cf542c50ff79
|
|
challengeType: 5
|
|
title: 'Problem 249: Prime Subset Sums'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 249: sumas de primer subconjunto'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Sea S = {2, 3, 5, ..., 4999} el conjunto de números primos menores que 5000. Encuentre el número de subconjuntos de S, la suma de cuyos elementos es un número primo. Ingrese los 16 dígitos más a la derecha como su respuesta. </section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler249()</code> debe devolver 9275262564250418.
|
|
testString: 'assert.strictEqual(euler249(), 9275262564250418, "<code>euler249()</code> should return 9275262564250418.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler249() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler249();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|