← Complete problem index

PROJECT EULER · #0316

Numbers in Decimal Expansions

Statement only · UnsolvedOriginal problem ↗

Let p=p1p2p3 be an infinite sequence of random digits, selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.
It can be seen that p corresponds to the real number 0.p1p2p3
It can also be seen that choosing a random real number from the interval [0,1) is equivalent to choosing an infinite sequence of random digits selected from {0,1,2,3,4,5,6,7,8,9} with equal probability.

For any positive integer n with d decimal digits, let k be the smallest index such that pk,pk+1,,pk+d1 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 n=2999g(106n)=27280188, find n=2999999g(1016n).

Note: x represents the floor function.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.