79d9012432
* fix(curriculum): tests quotes * fix(curriculum): fill seed-teardown * fix(curriculum): fix tests and remove unneeded seed-teardown
61 lines
1.1 KiB
Markdown
61 lines
1.1 KiB
Markdown
---
|
|
id: 5900f3c81000cf542c50fedb
|
|
challengeType: 5
|
|
title: 'Problem 92: Square digit chains'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.
|
|
For example,
|
|
44 → 32 → 13 → 10 → 1 → 1
|
|
85 → 89 → 145 → 42 → 20 → 4 → 16 → 37 → 58 → 89
|
|
Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop. What is most amazing is that EVERY starting number will eventually arrive at 1 or 89.
|
|
How many starting numbers below ten million will arrive at 89?
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler92()</code> should return 8581146.
|
|
testString: assert.strictEqual(euler92(), 8581146, '<code>euler92()</code> should return 8581146.');
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler92() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler92();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|