56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4291000cf542c50ff3b
|
||
challengeType: 5
|
||
title: 'Problem 188: The hyperexponentiation of a number'
|
||
videoUrl: ''
|
||
localeTitle: 问题188：数字的过度扩展
|
||
---
|
||
|
||
## Description
|
||
<section id="description">由↑^ b或ba表示的正整数b的数字a的过度增强或分解通过以下方式递归地定义：a↑↑1 = a，a↑↑（k + 1）= a（a↑↑k ）。 <p>因此我们有例如3↑↑2 = 33 = 27，因此3↑↑3 = 327 = 7625597484987和3↑↑4大致是103.6383346400240996 * 10 ^ 12。查找1777↑↑1855的最后8位数字。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler188()</code>应该返回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>
|