Probability to Compute Divisor of a Hidden Integer
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:
PDFDOI: https://doi.org/10.5539/jmr.v10n1p1
License URL: http://creativecommons.org/licenses/by/4.0
Journal of Mathematics Research ISSN 1916-9795 (Print) ISSN 1916-9809 (Online)
Copyright © Canadian Center of Science and Education
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.
----------------------------------------------------------------------------------------------------------------------------------------------------------------------