## A subtle problem.

Let $T: \mathbb{N}\to\mathbb{N}$ be given by

$T(n)=\left\{\begin{array}{cc}3n+1& \text{ if } n\text{ is odd.}\\ \frac{n}{2}& \text{ if }n\text{ is even.}\end{array}\right.$

Here’s the problem:

For all $n\in \mathbb{N}$, does there exist some $m$ (dependent on $n$) for which $T^m(n)=1$? (Of course, $T^m$ denotes iteration of $T$, $m$ times.)

If this is true, then notice the orbit of $T$ will always converge to the sequence $1,4,2,1,4,2,\dots$. Now pick a small number and try out the iterations by hand. If you’re really curious about trying some larger examples, you can open up Python and try the code at the end of this post to avoid the tedious calculations. I’ve been thinking about this problem for the past week or so and thought you’d enjoy to think about it as well.

Stay tuned for some posts on the Discrete Mathematicians Intermediate Value Theorem!

def awesome(n):
while n!=1:
if n%2==1:
n=3*n+1
print(n)
if n%2==0:
n=n//2
print(n)