$3n + 3^k$ Problem

Abstract

The Collatz problem is generalized into $3n + 3^k$ problem. It is shown that as long as the Collatz function iterates converge to the cycle passing through the number 1, the $3n + 3^k$ sequence converges to the cycle passing through the number $3^k$ for arbitrary positive integers $n$ and $k$. The proof shows that the sequence of $3n + 3^k$ function iterates for a number $3^k n$ is exactly the sequence of the Collatz function iterates for $n$ multiplied by $3^k$.