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.


This work is licensed under a Creative Commons Attribution 4.0 License.
  • Issn(Print): 1916-9795
  • Issn(Onlne): 1916-9809
  • Started: 2009
  • Frequency: bimonthly

Journal Metrics

Google-based Impact Factor (2018): 3.1

  • h-index (August 2018): 16
  • i10-index (August 2018): 35
  • h5-index (August 2018): 9
  • h5-median (August 2018): 9

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact