Factorization of large numbers and the suggestion of an algorithm
de Oliveira, Fabiano Sutter
Original · EN
In this paper, we intend to present a new algorithm to factorize large numbers. According to the algorithm proposed here, we prove that there is a common factor between p and q. With this procedure, the time of factorization considerably decreases. The algorithm is based on a graphic representation and, when the corresponding graph is drawn, coordinate pairs will originate two straight lines that intercept one another. These coordinate pairs are formed by prime numbers in the x-axis, and factors in the y-axis, including the factor in common.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.