r/askmath • • 1d ago

Probability Probability problem please help

Regarding my last post's comments, this is a different question now but same principle.

In a simulation, basically:

You start with a number, let's use 100.

You have a 50% chance of rolling the color green or red.

If you hit GREEN your number goes up by 50%.

If you hit RED your number goes down by 5%.

Also, if the number ever goes <1, the sequence stops.

THE QUESTION:

Given infinite sequences of infinite random rolls, which sequence is more likely to get:

1 - A sequence where it eventually stops, due to a large enough red sequence

2 - A sequence with no reds at all

3 - They have the same probability

8 Upvotes

26 comments sorted by

12

u/ultimatepoker 1d ago

A sequence with no reds has probability zero.

A sequence that stops can happen with 90 reds in a row. Unlikely but not probability zero.

3

u/SomethingMoreToSay 1d ago

This is the simplest, and most correct, answer.

3

u/rhodiumtoad 0⁰=1, just deal with it 1d ago

The best way (I guess) to analyze this is to look at the log of the value rather than the value itself. The initial value is log(100), the increase is done by adding log(1.5), the decrease by adding log(0.95) (which will be less than 0), and the sequence ends if you hit or go below log(1), which is 0. The only snag is that these can't be converted to integer steps, because you need a non-integer number of 5% decreases to match a 50% increase. (You can fudge the numbers slightly to get integers; using 4.942% for the decrease rather than 5% makes one increase equal to 8 decreases.

3

u/rhodiumtoad 0⁰=1, just deal with it 1d ago

With an initial value of 100, and fudging the percentage as described above, I believe that the probability of the sequence ever stopping is on the order of 10-27 (call it one in a billion billion billion), while the chance of no reds at all is of course 0.

2

u/EdgyMathWhiz 1d ago edited 1d ago

How'd you calculate it?  Form a recurrence 2a[n] = a[n+1] + a[n-8] and solve?

Via Gemini (but I know enough to have an idea if it's talking nonsense) you can use Wald's identity,make it a martingale and end up with a final solution of 9.66x10-28

Interesting (but not that surprising if you think about it): the probability of losing by getting 90 successive reds at the start is about 8.08x10-28.  So if you do lose, there's a 5/6 chance it was by losing 90 times at the start.

3

u/rhodiumtoad 0⁰=1, just deal with it 1d ago

I didn't have time to do it properly, I did an estimate based on the chance of starting with 90 reds, then satisfied myself that the other routes to failure wouldn't push the probability up much.

1

u/mH48124 16h ago

N 以内で 0 になるのに必要な減少回数 n は

log(100) + (N-n)log(1.5) + n log(0.95) < 0 から求まる

1

u/EnLaSxranko 1d ago

The fact that there's no way for the sequence to end without going below 1 and P(no red)=(1/2)n for n terms (therefore the probability of no red approaches zero as the number of terms approaches infinity), the probability that the sequence terminates due to a sequence of reds is higher.

1

u/stanitor 1d ago

You asked this question on the discussion of your other post, and I answered it there. The probability of no reds = the probability of all reds = 0. There are many sequences that eventually stop, so the probability of that is higher than 0 (although it is still very low).

-1

u/AggressiveSpatula 1d ago

Well the odds of never getting a red at 50% odds in infinite rolls has to be zero, right? However unlikely scenario 1 is, 2 has to be impossible… right? Idk how probability works at an infinite scale I guess is part of the issue.

As for how likely sequence 1 is, I have to imagine that it’s relatively very likely at the start, and then vanishes effectively to zero as time goes on. Green simply scales so much faster, I don’t think it matters that it’s on an infinite scale. The odds of getting 1000 reds in a row are the same odds of getting 1000 greens in a row, but the greens 10x the pace of the reds. Even distributing it down to a more reasonable event such as a smaller streak of reds, you’d still need at least 11 reds interrupted by a green just to make downward movement, and then chain that over and over and over again.

Even starting at 100 I just tested it and it takes 90 reds to get under 1 because a smaller and smaller piece gets removed every roll. It only took 12 greens to go from that number back up over 100. From 1000 to 100 it took 45 reds but only 6 greens to reverse it.

I guess the answer is 3. They’re both as likely simply because they can both never happen. That said, never hitting a red is intrinsically less likely because it carries the same odds as scenario 1, but with an added restriction. You’ll never get reds showing up 10x more often than the greens all the way to zero, but you’ll also never get no reds showing up at all. A less likely never lol.

3

u/rhodiumtoad 0⁰=1, just deal with it 1d ago

The probability of no reds at all is exactly 0, because the sequence can't terminate without reds, and the limit of P(no reds in N tries) is 0 as N goes to infinity.

The probability of the sequence terminating is very small but not zero, and depends quite heavily on the initial value.

2

u/AdjectiveNounNNNN 1d ago

They’re both as likely simply because they can both never happen.

Why do you think that? Termination can definitely happen, even if it is fairly unlikely.

-1

u/AggressiveSpatula 1d ago

I just feel like after an initial climb the odds are too astronomical to ever happen. It’s not an issue of a one in x odds event happening, it’s that it has to happen on demand. So to get from 100 to less than 1 you need 90 reds in a row at 50% odds. Idk if this is the exact notation you’d use, but let’s just say that equates to 1 in 2^90. Idk if that’s right, but it’s a large enough number to prove a point. Now, what are the odds that a 1 in 2^90 event happens over the course of infinity? 1. It’s pretty much guaranteed. But we don’t need it to happen eventually, we need it to happen exactly now. We need the 1 in 2^90 event to happen on our first 90 rolls. Let’s say it climbs to 1000, we now need a 1 in 2^135 event to happen. Will that happen after infinite tries? Of course, but we need it to happen right now while we’re at 1000.

What makes it impossible isn’t the event of a certain possibility happening, it’s it happening exactly when it’s needed.

4

u/AdjectiveNounNNNN 1d ago

2-90>0, so it's not impossible for it to happen right away, therefore it's not impossible period.

0

u/AggressiveSpatula 1d ago

I guess I would say that given infinite starts to the problem it’s inevitable that there will be some that reach termination. In fact there would be an infinite amount that reach termination.

But if we start the problem one time and run it for infinite time, it’s impossible. The issue remains that the event has to happen on demand.

3

u/AdjectiveNounNNNN 1d ago

You're not using "impossible" to mean what everyone else uses it to mean, apparently.

Terminating is more likely, because a probability greater than 0 is greater than a probability equal to 0.

1

u/AggressiveSpatula 1d ago

I think I’ve identified my confusion.

I’m having a hard time holding two things to be true at once:

If an event has a greater than zero probability of happening (termination), then on an infinite timeline it must happen.

I am having difficulty weighing that because I want to come to the conclusion that on an infinite timescale, the program must terminate.

I grant that the odds are technically greater than zero, but I don’t know how to rectify that with the potential conclusion that the program never terminates.

What do you think? Is termination always inevitable on an infinite timeline? If the odds are greater than zero and we try for infinite time, how could we not assume that it always terminates?

3

u/AdjectiveNounNNNN 1d ago

No, termination is definitely not guaranteed. I've never suggested it is. There is a 2-90 probability of it happening right away, plus a tiny bit more for paths that include a small number of increases. The game will very likely continue forever, but the probability of termination is not 0.

1

u/AggressiveSpatula 1d ago

Oye my head lol. I’m too black and white for this shit lol

2

u/EdgyMathWhiz 1d ago

If it helps, suppose you have a game where the chance of terminating on step k is 10-k.  Then however far you go, there's still a chance of the game terminating.

But the TOTAL chance of it terminating is 0.1111....  = 1/9 , so it's by no means certain to terminate.

→ More replies (0)

-2

u/StoicTheGeek 1d ago

Without thinking about it too much, I'm pretty sure this sequence is guaranteed to terminate.

In an infinite sequence of 50/50 rolls, you are certain to get an arbitrarily large number of each colour in a row. So eventually you'll hit a sequence of reds that will wipe out whatever greens you have.

(I could easily be wrong though, as it's not a single number that we are chasing, but a constantly increasing one. But my gut feel says it terminates).

4

u/rhodiumtoad 0⁰=1, just deal with it 1d ago

Wrong. This is a biased random walk, so the infinite survival probability is non-zero. (If the step size were equal, the survival probability would tend to 0.)

2

u/StoicTheGeek 1d ago

That’s why I should never trust my gut. Thanks

3

u/EdgyMathWhiz 1d ago

If your stake is multiplied by p on a win and q on a loss, then if pq > 1, there's a non-zero probability you never go bust.

For more info, search Kelly Growth Factor.

1

u/StoicTheGeek 1d ago

Thanks for the tip - something new to learn.