Dynamics of the iterated map $n \to 3n+1$ if $n$ is odd and $n \to \frac n2 $ if $n$ is even. Generalizations to $n \to 3n-1 $ or $ n \to 5n+1$ or even to $n \to pn+q$ . Other names are "$3x+1$-problem","syracuse problem". If you have a question, please be specific to your detail. MSE is not ...
My second question here. Does it show that I know very little about mathematics? :) I'm doing Project Euler Question 14 and would like to know what the right arrow → means in: ...
I've had a thought about the Collatz conjecture (the 3n+1 problem). Suppose some number, C, diverges under the iteration. We first note that C must be odd because if C were even it would be halved ...
From the get go: i'm not trying to prove the Collatz Conjecture where hundreds of smarter people have failed. I'm just curious. I'm wondering where one would have to start in proving the Collatz ...
A long time ago I was messing around with the Collatz problem and I stumbled across a "proof" that the iterations will converge. I was too embarrassed to show anyone, and I recently just remembered ...
I have been wondering if there are any numbers that exist only in their own string of the 3n+1 problem. I need to explain that better. Basically, when you follow the rules of the conjecture, you end ...
The Collatz Conjecture is a famous conjecture in mathematics that has lasted for over 70 years. It goes as follows: Define $f(n)$ to be as a function on the natural numbers by: $f(n) = n/2$ if $n$ ...
I have been fascinated by this problem since I first heard about it in high school. From the Wikipedia article http://en.wikipedia.org/wiki/Collatz_problem: Take any natural number $n$. If $n$ is ...