freeCodeCamp

1.1 KiB

Raw Blame History

id	challengeType	title	forumTopicId
5900f3a41000cf542c50feb7	5	Problem 56: Powerful digit sum	302167

Description

A googol (10¹⁰⁰) is a massive number: one followed by one-hundred zeros; 100¹⁰⁰ 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, a^b, where a, b < 100, what is the maximum digital sum?

Instructions

Tests

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);

Challenge Seed

function powerfulDigitSum() {

  return true;
}

powerfulDigitSum();

Solution

// solution required

1.1 KiB Raw Blame History