Universal Journal of Computational Mathematics(CEASE PUBLICATION) Vol. 3(2), pp. 22 - 23
DOI: 10.13189/ujcmj.2015.030202
Reprint (PDF) (58Kb)

The Algorithm (3a +1) in the Problem of Computing O(2ⁿ)

Andri Lopez ^*
Department of Mathematics, School of Minas, Leon, Spain

ABSTRACT

In this article I demonstrate the Collatz conjecture that there are infinitely because there are infinitely many values of (a) magic in set of the integers numbers that lead directly to the cycle 4,2,1. With the algorithm (3a + 1) we have always one of the (a) magic. Another contribution of this paper is the demonstration for existing two equations for polynomial time of all 2ⁿ. Finally the existence of another algorithm for 4,2,1 cycle; as is the (7a + 1).

KEYWORDS
Equations (1), Magic Number, O(2ⁿ), Exist Algorithms Infinite for 4,2,1

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Andri Lopez , "The Algorithm (3a +1) in the Problem of Computing O(2ⁿ)," Universal Journal of Computational Mathematics(CEASE PUBLICATION), Vol. 3, No. 2, pp. 22 - 23, 2015. DOI: 10.13189/ujcmj.2015.030202.

(b). APA Format:
Andri Lopez (2015). The Algorithm (3a +1) in the Problem of Computing O(2ⁿ). Universal Journal of Computational Mathematics(CEASE PUBLICATION), 3(2), 22 - 23. DOI: 10.13189/ujcmj.2015.030202.