An Application of the Algorithm (3a+1) in the Problem of Computing (𝟐𝒏)

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𝑛 in polynomial time not only the individual values of (n) if no all values of an interval = (1; 2; 3; 4; 5; 6; … … . . 𝐾 → ∞). 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.

Author (S) Details

Andri Lopez
Institute Polytecnicleon, Leon Spain.

View Book :-

Leave a Reply

Your email address will not be published. Required fields are marked *

Back To Top