On asymptotic behavior of composite integers n = pq
On asymptotic behavior of composite integers n = pq
复制标题
关于复合整数 n = pq 的渐近行为
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Yasufumi Hashimoto
中科院分区：
文献类型：
--
作者：
Yasufumi Hashimoto
本文研究了两个素数乘积所写的合整数个数的渐近性态。这样的整数有时被称为RSA整数，因为它们在RSA密码系统中使用。所有这些整数的数量已经研究了朗道，萨特，塞尔伯格等此外，一些整数n = pq和p 1最近研究了德克尔和莫里。本文推广了Decker-Moree的结果，主要定理描述了对于固定增函数f，p < q < f（p）的整数个数的渐近公式。
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 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 fixed increasing function f .