Jump to content
BrainDen.com - Brain Teasers
  • 0

Probability in Pi


k-man
 Share

Question

It is a well-known fact that the number pi is an irrational number. This means that its decimal representation is infinitely long.

3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706798214808651328230664...

What is the probability that pi's decimal representation contains a sequence of digits ...0123456789....?

What is the probability that it contains ...33333333333333333333...?

Link to comment
Share on other sites

8 answers to this question

Recommended Posts

  • 0

I think this argument should hold water.

Consider an event with any given small, but finite and fixed, probability of occurring on any given trial. Call that probability p, and the number of trials that you run n.

No matter how many trials you run, you can never be 100% sure that the event will happen. But you can chose any probability g which is good enough, say 95% probability that the event will occur after n trials, and simply solve for the value of n that would be a sufficient number of trials to reach a probability g that the event occurs.

The probability that the event will NOT occur after n trials is (1-p)n, so you can solve:

(1-p)n < (1-g)

n > log(base 1-p) of (1-g)

For any value of g you want, like 99.9999999999%, you can solve for a value of n and say that the event will occur with probability g after n trials. And I think that's about as much of a guarantee as you can ask for.

Link to comment
Share on other sites

  • 0

Any other thoughts?

Would you agree with the following generalization?

Any event with a non-zero probability p>0 of occurring on a single trial (no matter how small) will occur with the probability of 1 over an infinite number of trials.

Link to comment
Share on other sites

  • 0

I don't know that it applies, although it sounds related. As I recall hearing it, it holds that a system will visit every available state given enough time. A weaker "quasi" ergodic theorem says that a system will visit a finite region around every available state (implying there is a distance function of some type) given enough time.

The resolution of your conjecture may not be covered by either of these.

The resolution may rest on certain conditions being satisfied. It's a zero-times-infinity puzzle that might require either a strong intuition or great mathematical skill to answer. I have some intuition, but it's often wrong. That fact keeps me coming back to this site. ^_^

So I wonder whether the decimal expansion for e can occur within the expansion for pi.

Link to comment
Share on other sites

  • 0

I think this argument should hold water.

Consider an event with any given small, but finite and fixed, probability of occurring on any given trial. Call that probability p, and the number of trials that you run n.

No matter how many trials you run, you can never be 100% sure that the event will happen. But you can chose any probability g which is good enough, say 95% probability that the event will occur after n trials, and simply solve for the value of n that would be a sufficient number of trials to reach a probability g that the event occurs.

The probability that the event will NOT occur after n trials is (1-p)n, so you can solve:

(1-p)n < (1-g)

n > log(base 1-p) of (1-g)

For any value of g you want, like 99.9999999999%, you can solve for a value of n and say that the event will occur with probability g after n trials. And I think that's about as much of a guarantee as you can ask for.

Agree.

Link to comment
Share on other sites

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Guest
Answer this question...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

Loading...
 Share

  • Recently Browsing   0 members

    • No registered users viewing this page.
×
×
  • Create New...