-
- Hashimoto, Yasufumi
- Institute of Systems, Information Technologies and Nanotechnologies
Search this article
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.
MI: Global COE Program Education-and-Research Hub for Mathematics-for-Industry
Journal
-
- Journal of Math-for-Industry (JMI)
-
Journal of Math-for-Industry (JMI) 1 (A), 45-49, 2009-04-08
Faculty of Mathematics, Kyushu University
- Tweet
Details 詳細情報について
-
- CRID
- 1050580007682597120
-
- NII Article ID
- 120001177117
-
- NII Book ID
- AA12444018
-
- ISSN
- 18844774
- 18844782
-
- HANDLE
- 2324/13973
-
- NDL BIB ID
- 10948538
-
- Text Lang
- en
-
- Article Type
- journal article
-
- Data Source
-
- IRDB
- NDL
- CiNii Articles