<journal article>
On asymptotic behavior of composite integers n = pq

Creator
Language
Publisher
Date
Source Title
Vol
Issue
First Page
Last Page
Publication Type
Access Rights
Related DOI
Related DOI
Related URI
Relation
Abstract In this paper, we study the asymptotic behavior of the number of composite integers written by products of two primes. Such integers are sometimes called by the RSA integers, because these are used in... the RSA cryptosystems. The number of all such integers has been already studied by Landau, Sathe, Selberg etc. Furthermore, the number of integers with n = pq and p < q < cp for a fi xed c > 1 was recently studied by Decker and Moree. The aim of this paper is to extend Decker-Moree's result, and the main theorem describes the asymptotic formula of the number of integers with p < q < f(p) for a xed increasing function f.show more

Hide fulltext details.

pdf JMI2009A-6 pdf 157 KB 212  

Details

Record ID
Peer-Reviewed
Subject Terms
Notes
Type
Created Date 2009.10.20
Modified Date 2019.08.29

People who viewed this item also viewed