56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
|
id: 5900f49d1000cf542c50ffaf
|
|
challengeType: 5
|
|
title: 'Problem 304: Primonacci'
|
|
videoUrl: ''
|
|
localeTitle: 'Número 304: Primonacci'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> Para cualquier entero positivo n, la función next_prime (n) devuelve el p primo más pequeño tal que p> n. <p> La secuencia a (n) se define por: a (1) = next_prime (1014) y a (n) = next_prime (a (n-1)) para n> 1. </p><p> La secuencia de fibonacci f (n) se define por: f (0) = 0, f (1) = 1 y f (n) = f (n-1) + f (n-2) para n> 1. </p><p> La secuencia b (n) se define como f (a (n)). </p><p> Encuentra ∑b (n) para 1≤n≤100 000. Da tu respuesta mod 1234567891011. </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler304()</code> debe devolver 283988410192.
|
|
testString: 'assert.strictEqual(euler304(), 283988410192, "<code>euler304()</code> should return 283988410192.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler304() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler304();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|