freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-357-prime-generating-integers.spanish.md

---
id: 5
localeTitle: 5900f4d11000cf542c50ffe4
challengeType: 5
title: 'Problem 357: Prime generating integers'
---

## Description
<section id='description'> 
Considera los divisores de 30: 1,2,3,5,6,10,15,30. 
Se puede ver que para cada divisor d de 30, d + 30 / d es primo. 


Encuentre la suma de todos los enteros positivos n que no excedan de 100 000 000, de modo que 
para cada divisor d de n, d + n / d es primo. 
</section>

## Instructions
<section id='instructions'> 

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler357()</code> debe devolver 1739023853137.
    testString: 'assert.strictEqual(euler357(), 1739023853137, "<code>euler357()</code> should return 1739023853137.");'

```

</section>

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

<div id='js-seed'>

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

euler357();
```

</div>



</section>

## Solution
<section id='solution'>

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