freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-10-summation-of-primes.spanish.md

---
id: 5900f3761000cf542c50fe89
challengeType: 5
title: 'Problem 10: Summation of primes'
videoUrl: ''
localeTitle: 'Problema 10: Suma de números primos'
---

## Description
<section id="description"> La suma de los números primos debajo de 10 es 2 + 3 + 5 + 7 = 17. Encuentra la suma de todos los números primos debajo de n. </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>primeSummation(17)</code> debe devolver 41.
    testString: 'assert.strictEqual(primeSummation(17), 41, "<code>primeSummation(17)</code> should return 41.");'
  - text: <code>primeSummation(2001)</code> debe devolver 277050.
    testString: 'assert.strictEqual(primeSummation(2001), 277050, "<code>primeSummation(2001)</code> should return 277050.");'
  - text: <code>primeSummation(140759)</code> debe devolver 873608362.
    testString: 'assert.strictEqual(primeSummation(140759), 873608362, "<code>primeSummation(140759)</code> should return 873608362.");'
  - text: <code>primeSummation(2000000)</code> debe devolver 142913828922.
    testString: 'assert.strictEqual(primeSummation(2000000), 142913828922, "<code>primeSummation(2000000)</code> should return 142913828922.");'

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function primeSummation(n) {
  // Good luck!
  return true;
}

primeSummation(2000000);

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>