56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
|
id: 5900f4291000cf542c50ff3b
|
|
challengeType: 5
|
|
title: 'Problem 188: The hyperexponentiation of a number'
|
|
videoUrl: ''
|
|
localeTitle: 'Problema 188: La hiperexposición de un número.'
|
|
---
|
|
|
|
## Description
|
|
<section id="description"> La hipereexposición o tetración de un número a por un entero positivo b, denotado por ↑↑ b o ba, se define recursivamente por: a ↑↑ 1 = a, a ↑↑ (k + 1) = a (a ↑↑ k ). <p> Así tenemos, por ejemplo, 3 ↑↑ 2 = 33 = 27, por lo que 3 ↑↑ 3 = 327 = 7625597484987 y 3 ↑↑ 4 es aproximadamente 103.6383346400240996 * 10 ^ 12. Encuentra los últimos 8 dígitos de 1777 ↑↑ 1855. </p></section>
|
|
|
|
## Instructions
|
|
<section id="instructions">
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler188()</code> debe devolver 95962097.
|
|
testString: 'assert.strictEqual(euler188(), 95962097, "<code>euler188()</code> should return 95962097.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler188() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler188();
|
|
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|