Conversion of Integer Factorization to a Problem of Decomposition of a Number. Part 1

The development of factorization mechanisms of composite integer numbers is considered in this work. The existent methods will not become more rapid and efficient in the nearest decade, due to narrow and inadequate mathematical approach to solution of this problem, which is based on so-called sieve of Eratosthenes. The mechanism suggested by author of this work, uses a completely new method based on examination of internal structure of natural sequence and application of digit place independent features (the criterion for divisibility).