Investigation of the algorithm for the numbers primality determining

摘要

The paper presents an algorithm for determining the simplicity of a number, based on the use of pseudo-simple numbers. On the basis of the previously formulated and proved theorem, it is proposed in the proof of the simplicity of a number to be based not on the product of possible components, but on their sum. The efficiency of using the proposed algorithm is checked. As a result of the pilot studies, the possibility of parallelizing the problem being solved is shown. With a slight modification of the algorithm, it is shown that it is possible to move from the problem of proving the simplicity of the number to the factorization problem.