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.2 KiB
Markdown
64 lines
1.2 KiB
Markdown
---
|
|
id: 5900f3a41000cf542c50feb7
|
|
challengeType: 5
|
|
title: 'Problem 56: Powerful digit sum'
|
|
forumTopicId: 302167
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
|
|
A googol (10<sup>100</sup>) is a massive number: one followed by one-hundred zeros; 100<sup>100</sup> is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1.
|
|
|
|
Considering natural numbers of the form, <var>a<sup>b</sup></var>, where <var>a</var>, <var>b</var> < 100, what is the maximum digital sum?
|
|
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>powerfulDigitSum()</code> should return a number.
|
|
testString: assert(typeof powerfulDigitSum() === 'number');
|
|
- text: <code>powerfulDigitSum()</code> should return 972.
|
|
testString: assert.strictEqual(powerfulDigitSum(), 972);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function powerfulDigitSum() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
powerfulDigitSum();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|