6cfd0fc503
* fix: improve Project Euler descriptions and test case Improve formatting of Project Euler test descriptions. Also add poker hands array and new test case for problem 54 * feat: add typeof tests and gave functions proper names for first 100 challenges * fix: continue fixing test descriptions and adding "before test" sections * fix: address review comments * fix: adjust grids in 18 and 67 and fix some text that reference files rather than the given arrays * fix: implement bug fixes and improvements from review * fix: remove console.log statements from seed and solution
1.4 KiB
1.4 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3c81000cf542c50fedb | 5 | Problem 92: Square digit chains | 302209 |
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
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?
Instructions
Tests
tests:
- text: <code>squareDigitChains()</code> should return a number.
testString: assert(typeof squareDigitChains() === 'number');
- text: <code>squareDigitChains()</code> should return 8581146.
testString: assert.strictEqual(squareDigitChains(), 8581146);
Challenge Seed
function squareDigitChains() {
// Good luck!
return true;
}
squareDigitChains();
Solution
// solution required