Factorization of large numbers and the suggestion of an algorithm

Please use this identifier to cite or link to this item: https://repositorio.mcti.gov.br/handle/mctic/6568

Full metadata record

DC Field	Value	Language
dc.contributor.author	Oliveira, Fabiano Sutter de	-
dc.date.accessioned	2024-09-10T17:47:09Z	-
dc.date.available	2024-09-10T17:47:09Z	-
dc.date.issued	2006	-
dc.identifier.uri	https://repositorio.mcti.gov.br/handle/mctic/6568	-
dc.description	conteúdo: Abstract -- 1. Introduction -- 2. General scheme -- 3. Examples and applications -- 4. General conclusions -- 5. Acknowledgments	pt_BR
dc.language	en	pt_BR
dc.publisher	Centro Brasileiro de Pesquisas Físicas	pt_BR
dc.rights	Acesso Aberto	pt_BR
dc.subject	Matemática	pt_BR
dc.title	Factorization of large numbers and the suggestion of an algorithm	pt_BR
dc.type	Folheto	pt_BR
dc.publisher.country	Brasil	pt_BR
dc.description.resumo	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.	pt_BR
Appears in Collections:	Publicações CBPF

Files in This Item:

File	Description	Size	Format
2006_factorization_large_numbers_suggestion_algorithm.pdf		78.58 kB	Adobe PDF	View/Open

Opções de acessibilidade