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.3 KiB
1.3 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3bc1000cf542c50fecf | 5 | Problem 80: Square root digital expansion | 302194 |
Description
It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all.
The square root of two is 1.41421356237309504880..., and the digital sum of the first one hundred decimal digits is 475.
For the first one hundred natural numbers, find the total of the digital sums of the first one hundred decimal digits for all the irrational square roots.
Instructions
Tests
tests:
- text: <code>sqrtDigitalExpansion()</code> should return a number.
testString: assert(typeof sqrtDigitalExpansion() === 'number');
- text: <code>sqrtDigitalExpansion()</code> should return 40886.
testString: assert.strictEqual(sqrtDigitalExpansion(), 40886);
Challenge Seed
function sqrtDigitalExpansion() {
// Good luck!
return true;
}
sqrtDigitalExpansion();
Solution
// solution required