The formulation of the 3 n −1 problem is simple but no one has found the solution yet. This paper transforms the original problem into its equivalent so that it becomes more suitable for computer validation. A new algorithm is proposed and implemented. The hypothesis is tested and proven to be valid for numbers 3 n −1, conclusive with number 3 32768 −1.