56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f5131000cf542c510024
|
||
challengeType: 5
|
||
title: 'Problem 421: Prime factors of n15+1'
|
||
videoUrl: ''
|
||
localeTitle: 'Problema 421: Factores primos de n15 + 1'
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> Los números de la forma n15 + 1 son compuestos para cada entero n> 1. Para los enteros positivos n y m, s (n, m) se defina como la suma de los factores primos distintos de n15 + 1 que no exceda m. <p> Por ejemplo, 215 + 1 = 3 × 3 × 11 × 331. Entonces s (2,10) = 3 y s (2,1000) = 3 + 11 + 331 = 345. </p><p> También 1015 + 1 = 7 × 11 × 13 × 211 × 241 × 2161 × 9091. Entonces s (10,100) = 31 y s (10,1000) = 483. Encuentra ∑ s (n, 108) para 1 ≤ n ≤ 1011. </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler421()</code> debe devolver 2304215802083466200.
|
||
testString: 'assert.strictEqual(euler421(), 2304215802083466200, "<code>euler421()</code> should return 2304215802083466200.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler421() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler421();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|