Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

It is an open problem whether the number $\pi$ is disjunctive in base $10$, i.e., whether every finite sequence appears (at least once) in the base $10$ expansion of $\pi$. Of course, every sequence of length $1$ appears, and it is readily checked that so does every sequence of length $2$. I guess the same can be easily checked for other small lengths, and has surely been done before. So, my question is the following:

For which natural numbers $n$ is it known that every sequence of length $n$ appears in the base $10$ expansion of $\pi$?

Searching the internet somewhat longer I found that this is known to be true for $n$ at most $7$. Surely there must be much better bounds...

share|improve this question
    
See here for a bit of background information... –  AlexR Sep 8 '13 at 21:17
    
Quoted from above: there's no particular reason for the digits of π to have any special pattern to them, so mathematicians expect that the digits of π more or less "behave randomly," and a random sequence of digits contains every possible finite string of digits with probability 1 by Borel's normal number theorem: en.wikipedia.org/wiki/Normal_number#Properties_and_examples –  AlexR Sep 8 '13 at 21:20
    
@AlexR: How are your comments related to the question? –  Fred Rohrer Sep 8 '13 at 21:36
    
I just happened to stumble across this (old) question, which is related to yours. It does not provide answers, but it provides references. I thought this might be interesting to you. –  AlexR Sep 8 '13 at 21:39

1 Answer 1

up vote 0 down vote accepted

(This answer is taken from the corresponding question on MO.)

This is known since 2010 at least for $n\leq 11$ -- see this entry in the OEIS or F. Bellards's page about digits of $\pi$. In fact, every sequence of length $11$ occurs once in the first $2\ 512\ 258\ 603\ 207$ digits of $\pi$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.