1.6 KiB
1.6 KiB
id | challengeType | title | forumTopicId |
---|---|---|---|
5900f4a81000cf542c50ffbb | 5 | Problem 316: Numbers in decimal expansions | 301972 |
Description
For any positive integer n with d decimal digits, let k be the smallest index such that pk, pk+1, ...pk+d-1 are the decimal digits of n, in the same order. Also, let g(n) be the expected value of k; it can be proven that g(n) is always finite and, interestingly, always an integer number.
For example, if n = 535, then for p = 31415926535897...., we get k = 9 for p = 355287143650049560000490848764084685354..., we get k = 36 etc and we find that g(535) = 1008.
Given that , find
Note: represents the floor function.
Instructions
Tests
tests:
- text: <code>euler316()</code> should return 542934735751917760.
testString: assert.strictEqual(euler316(), 542934735751917760);
Challenge Seed
function euler316() {
// Good luck!
return true;
}
euler316();
Solution
// solution required