[math-fun] Re: Path Question

I wrote:

(with one property for each finite string of 0's and 1's). So the quantification is that for each n, and for each bit-string of length n, there exists a constant C such that for all N > 1, the number of times the bit-string of length n occurs in the first N bits of S differs from (N-k+1)/2^n by less than C times log N.

For "N-k+1" read "N-n+1". Jim