freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.english.md

id	challengeType	title
5900f3ab1000cf542c50febe	5	Problem 63: Powerful digit counts

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>euler63()</code> should return 49.
    testString: assert.strictEqual(euler63(), 49, '<code>euler63()</code> should return 49.');

Challenge Seed

function euler63() {
  // Good luck!
  return true;
}

euler63();

Solution

// solution required