Probability to Compute Divisor of a Hidden Integer

Xingbo Wang, Jianhui Li, Zhikui Duan and Wen Wan

Journal of Mathematics Research, 2018, vol. 10, issue 1, 1-5

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.

Keywords: probability; greatest Common Divisor; integer factorization; probabilistic algorithm (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.ccsenet.org/journal/index.php/jmr/article/view/71333/39230 (application/pdf)
http://www.ccsenet.org/journal/index.php/jmr/article/view/71333 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:jmrjnl:v:10:y:2018:i:1:p:1

Access Statistics for this article

More articles in Journal of Mathematics Research from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().