An Application of the Algorithm (3a+1) in the Problem of Computing O\((2^n)\)

Abstract

This article has have as objective one: Present of two new algorithm for its application in the computers, with they we will can know all and of each of values \(2^n\) in polynomial time not only the individual values of (n) if no all values of an interval = (1;2;3;4;5;6;……..\(K \rightarrow\) \(\infty\)). As second objective, demonstration that there are infinite algorithms in the form Xa +1 for the cycle (4,2,1) under the statement of the Collatz conjecture.