Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

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>