1.2 KiB
1.2 KiB
id | challengeType | title |
---|---|---|
5900f46b1000cf542c50ff7d | 5 | Problem 254: Sums of Digit Factorials |
Description
Define sf(n) as the sum of the digits of f(n). So sf(342) = 3 + 2 = 5.
Define g(i) to be the smallest positive integer n such that sf(n) = i. Though sf(342) is 5, sf(25) is also 5, and it can be verified that g(5) is 25.
Define sg(i) as the sum of the digits of g(i). So sg(5) = 2 + 5 = 7.
Further, it can be verified that g(20) is 267 and ∑ sg(i) for 1 ≤ i ≤ 20 is 156.
What is ∑ sg(i) for 1 ≤ i ≤ 150?
Instructions
Tests
tests:
- text: <code>euler254()</code> should return 8184523820510.
testString: assert.strictEqual(euler254(), 8184523820510, '<code>euler254()</code> should return 8184523820510.');
Challenge Seed
function euler254() {
// Good luck!
return true;
}
euler254();
Solution
// solution required