2006/03/21 by Fabiano Sutter de Oliveira, de Oliveira, Fabiano Sutter
Computer Science · Engineering · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #graph theory and CDMA systems #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0603180
9 pages, 1 figure
arxiv created 2006/03/21 · openalex publication_date 2006/03/21 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.