mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2009-07-12, 22:28   #1
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

3·281 Posts
Default Chances of reaching infinity

I was wondering if the answer to the following problem was known:

Given a starting number, say 10.
You add 1 or subtract 1 where the chances of adding 1 is higher than subtracting.

Is there a chance of reaching infinity without reaching 0 first (i.e is the probability >0 ) This obviously depends on the chance of add 1 so consider:

case 1)
Chance of adding 1 is fixed. For example, start at 10 and add 1 90% of the time and subtract 1 10% of the time.

case 2)
Chance of subtracting 1 is 1 / ln(n) where n is the current number and adding is ln(n)-1/ln(n).

case 3)
chance of subtracting 1 is 1/n and adding is n-1/n

case 4)
chance of subtracting 1 is 1/2^n and adding 1 is 2^n-1/2^n.

-----
This arises trying to gain some intuition on aloquot sequences and whether they eventually might terminate. I think you could prove the chances of reaching a higher number of digits is greater than reaching less, so with d digits do you reach d+s or d-s digits first - or maybe do you reach 2d before reaching 1/2d?

If case 1 has a non-zero percentage, it would argue for some sequence to not terminate because it does appear the chance of going up is greater. It is not a proof because the numbers aren't random, but it would be a good intuition toward the result becaiuse the numbers act random.

If case 1 and case 4 differ (so case 1 has zero % and case 4 positive, then you could try numbers of a certain number of digits and see if they go up or down first. Try it for steps of 10 digits (20,30,40, etc) and plot it to see where in 1-4 the curve appears to be and try to find out the chance of reaching infinity with that case.

If case 4 has a zero percentage of reaching infinity, then it would give a strong argument against any sequence reaching infinity.

So is the answer known for case 1-4? I would be suprised if case 4 had a zero chance and I really don't know what the answer to case 1 is. BTW I am guessing that the answer for aliquot sequences is around/between 2 or 3 on the chances of increasing.
Greebley is offline   Reply With Quote
Old 2009-07-12, 22:45   #2
TimSorbet
Account Deleted
 
TimSorbet's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

10000101101112 Posts
Default

Quote:
Originally Posted by Greebley View Post
Is there a chance of reaching infinity without reaching 0 first (i.e is the probability >0 )
nonsense
Add 1 (or 2 or 10^10^10^n) however many (finite) number of times you like, even without ever subtracting, you can never reach infinity. You could say, "reach 10,000,000" digits or any finite number if you like, but you can never reach infinity.
If the chance of adding is between .5 and 1 (50% and 100%), and the starting value is above 0, you will always tend upwards but eventually hit or go below 0.
Something that might be helpful for the purposes of aliquot sequences would be, for a certain starting value and adding/subtracting chance, how soon you can expect the sequence to terminate (but note that from each index you still "expect" that this new sequence will terminate in x iterations). I don't know how to find this value, but it's probably not too complex, at least for fixed chances.

Note: this is in no way a proof of the conjecture that all aliquot sequences will terminate, only a result of assuming it is purely random.

Or I could be the one talking nonsense. But I think I've got most of this right...

Also, unless I'm misunderstanding what you're saying, your chances don't add up correctly. e.g. n=5 for case 4:
Quote:
Originally Posted by Greebley View Post
case 4)
chance of subtracting 1 is 1/2^n and adding 1 is 2^n-1/2^n.
1/2^n=1/32=.03125. Therefore the chance of adding should be 1-1/32=31/32=.96875. Your equation gives 2^5-1/2^5=32-1/32=31.96875. Probabilities above 1 aren't even possible...

Last fiddled with by TimSorbet on 2009-07-12 at 22:55
TimSorbet is offline   Reply With Quote
Old 2009-07-12, 23:19   #3
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

3·281 Posts
Default

The expression just needs a set of parenthesis.(2^n-1)/2^n

"reach infinity" is perhaps imprecise, but I mean the opposite of "always reach 0". An infinte sequence can 'reach infinity' in that sense - it never reaches 0. That is what we are doing with the Aliquot seqs. See if they reach 1 (or a cycle) if they never do, then they 'reach infinity' meaning for any number you name, I can find an element of the sequence higher than it.
Greebley is offline   Reply With Quote
Old 2009-07-12, 23:25   #4
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

22×3×499 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
nonsense
It's not nonsense, even if it is specified a bit oddly. The OP asks about the chance that the sequence (a sort of 1D random walk) will not return to 0.

Quote:
Originally Posted by Mini-Geek View Post
If the chance of adding is between .5 and 1 (50% and 100%), and the starting value is above 0, you will always tend upwards but eventually hit or go below 0.
Is that true? That's not what my intuition would have suggested.
CRGreathouse is offline   Reply With Quote
Old 2009-07-13, 00:20   #5
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

6,793 Posts
Default

I think this is similar to the gamblers problem when playing in a casino. Even if you play a game where the chance to win is >0.5 for each iteration, then you still should "expect" to eventually lose all of your stake (i.e. you reach zero) simply because the casino has more money than you.

So the answer to the original Q above, is that you will always reach zero, it might take a while but if you wait long enough it is expected to happen with certainty eventually.
retina is online now   Reply With Quote
Old 2009-07-13, 01:06   #6
axn
 
axn's Avatar
 
Jun 2003

23·683 Posts
Default

Quote:
Originally Posted by retina View Post
I think this is similar to the gamblers problem when playing in a casino. Even if you play a game where the chance to win is >0.5 for each iteration, then you still should "expect" to eventually lose all of your stake (i.e. you reach zero) simply because the casino has more money than you.

So the answer to the original Q above, is that you will always reach zero, it might take a while but if you wait long enough it is expected to happen with certainty eventually.
Have you done the math on this or are you just going by analogy and gut feel?
axn is offline   Reply With Quote
Old 2009-07-13, 01:42   #7
TimSorbet
Account Deleted
 
TimSorbet's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

11·389 Posts
Default

Quote:
Originally Posted by CRGreathouse View Post
Is that true? That's not what my intuition would have suggested.
Um...actually, I guessed that based on intuition. (similar to retina's reasoning and gambler analogy) See:
Quote:
Originally Posted by Mini-Geek View Post
Or I could be the one talking nonsense.
It seems to me that even if the odds were 1 in a billion to subtract one, and add 1 billion when they add, and you start at a billion, you should still expect to eventually, after some insanely long time (probably measured in millions of universe-lengths with 1 calculation per planck time...or something like that) reach 0. If not, would you expect a 51% chance to add 1, (49% chance to subtract 1), starting at 1, to reach 0? Of course. So where's the cutoff where you say "this is possible, this isn't", and how do you decide that?
Quote:
Originally Posted by Greebley View Post
The expression just needs a set of parenthesis.(2^n-1)/2^n
Oh, ok. It's just redundant then.
Quote:
Originally Posted by Greebley View Post
"reach infinity" is perhaps imprecise, but I mean the opposite of "always reach 0". An infinte sequence can 'reach infinity' in that sense - it never reaches 0. That is what we are doing with the Aliquot seqs. See if they reach 1 (or a cycle) if they never do, then they 'reach infinity' meaning for any number you name, I can find an element of the sequence higher than it.
Ah, yes, obviously. I guess I should've been able to assume that.
TimSorbet is offline   Reply With Quote
Old 2009-07-13, 01:48   #8
bsquared
 
bsquared's Avatar
 
"Ben"
Feb 2007

3×5×251 Posts
Default

All of your cases I think can be modeled as a 1D random walk:
http://mathworld.wolfram.com/RandomW...mensional.html

Where you have given the probabilies p and q of moving left or right on the number line. Clearly, for high enough skew between p and q, there is strong tend to grow without bound. But the variance of the distribution also grows without bound, so although it might be improbable, under this model I think there is always the possibility that the sequence will terminate.

But aliquot sequences are not random walks. The probability of moving up or down depends on previous moves (drivers and guides), and in general there is a state to the system. So it is maybe some kind of countably infinite Markov chain, and if so, is way past my pay grade to analyze.
bsquared is offline   Reply With Quote
Old 2009-07-13, 01:57   #9
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

22×3×499 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
Um...actually, I guessed that based on intuition. (similar to retina's reasoning and gambler analogy)
It seems unlike the gambler's ruin to me, because the bet/step is fixed rather than proportional to maximal holdings.

Quote:
Originally Posted by Mini-Geek View Post
It seems to me that even if the odds were 1 in a billion to subtract one, and add 1 billion when they add, and you start at a billion, you should still expect to eventually, after some insanely long time (probably measured in millions of universe-lengths with 1 calculation per planck time...or something like that) reach 0. If not, would you expect a 51% chance to add 1, (49% chance to subtract 1), starting at 1, to reach 0? Of course. So where's the cutoff where you say "this is possible, this isn't", and how do you decide that?
My intuition would suggest that if moving up had a higher probability than 0.5, the chance of hitting 0 (assuming you start above 0) would be less than 1. I'd be interested to see a proof either way.
CRGreathouse is offline   Reply With Quote
Old 2009-07-13, 03:49   #10
axn
 
axn's Avatar
 
Jun 2003

10101010110002 Posts
Default

Quote:
Originally Posted by Mini-Geek View Post
would you expect a 51% chance to add 1, (49% chance to subtract 1), starting at 1, to reach 0?
Numerical simulations suggest a 3.9% probability of unbounded growth for this case. So, the answer would be no. Not 100% of the time. (Of course it'd be great if someone could provide a closed-form solution to confirm the sim).
axn is offline   Reply With Quote
Old 2009-07-13, 05:36   #11
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

679310 Posts
Default

Actually easy to prove.

At some point, x, you will always have a non-zero chance to reach termination (0) equal to q^x. Where q=1-p of course, and p>0.5.

[edit]Assumes random selection and has no relationship to Aliquot things at all. The Aliquot stuff is not random so has no relevance here.[/edit]

Last fiddled with by retina on 2009-07-13 at 05:41
retina is online now   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
What are the chances that M44 isn't M44? jasong Information & Answers 12 2013-10-07 04:45
Infinity, thou art a heartless bitch chalsall Game 1 - ♚♛♝♞♜♟ - Shaolin Pirates 15 2013-02-20 20:53
Concept of the Infinity 9021951 Miscellaneous Math 51 2011-11-04 21:43
Infinity times Zero equals Two AntonVrba Lounge 4 2010-10-28 20:10
Prove that the limit is infinity.. kakos22 Information & Answers 4 2010-04-18 23:18

All times are UTC. The time now is 03:46.


Fri Jul 7 03:46:38 UTC 2023 up 323 days, 1:15, 0 users, load averages: 0.67, 0.83, 1.08

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔