1.1 KiB
1.1 KiB
id | challengeType | title |
---|---|---|
5900f3e41000cf542c50fef6 | 5 | Problem 119: Digit power sum |
Description
Instructions
Tests
tests:
- text: <code>euler119()</code> should return 248155780267521.
testString: assert.strictEqual(euler119(), 248155780267521, '<code>euler119()</code> should return 248155780267521.');
Challenge Seed
function euler119() {
// Good luck!
return true;
}
euler119();
Solution
// solution required