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
64 lines
1.0 KiB
Markdown
64 lines
1.0 KiB
Markdown
---
|
|
id: 5900f3ab1000cf542c50febe
|
|
challengeType: 5
|
|
title: 'Problem 63: Powerful digit counts'
|
|
forumTopicId: 302175
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
|
|
The 5-digit number, 16807 = 7<sup>5</sup>, is also a fifth power. Similarly, the 9-digit number, 134217728 = 8<sup>9</sup>, is a ninth power.
|
|
|
|
How many <var>n</var>-digit positive integers exist which are also an <var>n</var>th power?
|
|
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
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);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function powerfulDigitCounts() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
powerfulDigitCounts();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|