  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.
