Factorization of large numbers and the suggestion of an algorithm
| dc.creator | de Oliveira, Fabiano Sutter | |
| dc.date | 2006-03-21 | |
| dc.date.accessioned | 2026-07-07T07:08:04Z | |
| dc.date.available | 2026-07-07T07:08:04Z | |
| dc.description | 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. | |
| dc.description | 9 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0603180 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0603180 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/110621 | |
| dc.subject | Quantum Physics | |
| dc.title | Factorization of large numbers and the suggestion of an algorithm | |
| dc.type | text |