MathDB
2020 BMT Team 15

Source:

January 9, 2022
floor functioncombinatorics

Problem Statement

Consider a random string ss of 10202010^{2020} base-ten digits (there can be leading zeroes). We say a substring ss' (which has no leading zeroes) is self-locating if ss' appears in ss at index ss' where the string is indexed at 1 1. For example the substring 1111 in the string “122352242411122352242411” is selflocating since the 1111th digit is 1 1 and the 1212th digit is 1 1. Let the expected number of self-locating substrings in s be GG. Compute G\lfloor G \rfloor.