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.0 KiB
1.0 KiB
id, challengeType, title, forumTopicId
| id | challengeType | title | forumTopicId |
|---|---|---|---|
| 5900f3ab1000cf542c50febe | 5 | Problem 63: Powerful digit counts | 302175 |
Description
The 5-digit number, 16807 = 75, is also a fifth power. Similarly, the 9-digit number, 134217728 = 89, is a ninth power.
How many n-digit positive integers exist which are also an nth power?
Instructions
Tests
tests:
- text: <code>powerfulDigitCounts()</code> should return a number.
testString: assert(typeof powerfulDigitCounts() === 'number');
- text: <code>powerfulDigitCounts()</code> should return 49.
testString: assert.strictEqual(powerfulDigitCounts(), 49);
Challenge Seed
function powerfulDigitCounts() {
// Good luck!
return true;
}
powerfulDigitCounts();
Solution
// solution required