Probability to Compute Divisor of a Hidden Integer
- Xingbo Wang
- Jianhui Li
- Zhikui Duan
- Wen Wan
Abstract
The article makes an investigation on the probability of finding the greatest common divisor between a given integer and a hidden integer that lies in an integer interval. It shows that, adding the integers that are picked randomly in the interval results in a much bigger probability than subtracting the picked integers one with another. Propositions and theorems are proved and formulas to calculate the probabilities are presented in detail. The research is helpful in developing probabilistic algorithm of integer factorization.- Full Text:
PDF
- DOI:10.5539/jmr.v10n1p1
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org