Mariga wrote:Hi people, yes I have the proof. In fact it is quite simple and the technique used can be used to prove other sequences.. I don't know who to trust with this information or where to submit it.
Guest wrote:The "proof" isn't correct. People often say that the Collatz conjecture intuitively ought to be true, because half the time you multiple by 1.5 and half the time you divide by 2, so it seems like on average it should be going down. But that isn't a proof. It's just an intuitive argument. And that kind of argument sometimes gives the wrong result.
Here's how to use a similar "proof" to prove something false. Define f(n) to be n+5 if n is a multiple of 10, and n-1 otherwise. You could say that a random n has only a 10% chance of increasing by 5, and a 90% chance of decreasing by 1, and so on average it will decrease. And so this function shouldn't have any cycles at high numbers. But the truth is that EVERY starting number reaches a small cycle!
Why is the "proof" wrong? Because we are not handling the probabilities correctly.
First, you can't say that a random number is odd 50% of the time, unless you first describe how you plan to generate the random number. You have to say what the probability distribution is. And you can't just say "every number is equally likely". That would be a uniform probability distribution over an infinite set, which is mathematically impossible.
Second, even if you could define the probability distribution of n where you're starting, you'd also having to define the distribution after you've iterated the f() function many times. In my example, after iterating f() many times, you're guaranteed to be at a multiple of 10 or within 5 greater than it. Definitely not a number like 107. So the true probability distribution after many steps isn't as simple as it was on the first or second step.
Third, even if you could somehow prove that a random starting number n has a 100% probability of satisfying Collatz, that wouldn't necessarily prove that all numbers satisfy Collatz. This is something weird about probabilities over infinite sets. Just because something is true 100% of the time, that doesn't mean it's true all the time. Yes, that's strange. In math terms, there's a difference between "true with probability one" and "true". A mathematician would say that if you flip a fair coin repeatedly, forever, then you will eventually see heads, with probability 1 (which is a 100% probability), but that you are not guaranteed to ever flip heads. Because it is theoretically possible to flip only tails forever. Flipping tails forever has a probability of zero, but it is not impossible.
TL;DR: probabilities are tricky, which is why the "proof" was incorrect.
Guest wrote:Guest wrote:...
TL;DR: probabilities are tricky, which is why the "proof" was incorrect.
Your arguments are non-mathematical, illogical, and fictional. What we need is a sound mathematical argument (proof) or a conterexample which explains why the Collatz conjecture is true or false. You have not prove not disprove the conjecture... Your efforts are fruitless. Please stop.
Guest wrote:Guest wrote:Guest wrote:...
TL;DR: probabilities are tricky, which is why the "proof" was incorrect.
Your arguments are non-mathematical, illogical, and fictional. What we need is a sound mathematical argument (proof) or a conterexample which explains why the Collatz conjecture is true or false. You have not prove not disprove the conjecture... Your efforts are fruitless. Please stop.
He isn't trying to prove or disprove the conjecture, he is trying to show that mariga's proof is incorrect
guest
Users browsing this forum: No registered users and 1 guest