On asymptotic behavior of composite integers n = pq - Collections

＜journal article＞
On asymptotic behavior of composite integers n = pq

Creator	Creator Name Hashimoto, Yasufumi 橋本, 康史ハシモト, ヤスフミ Affiliation Affiliation Name Institute of Systems, Information Technologies and Nanotechnologies 九州システム情報技術研究所
Language	English
Publisher	Faculty of Mathematics, Kyushu University
Publisher	九州大学大学院数理学研究院
Date	2009-04-08
Source Title	Journal of Math-for-Industry (JMI)
Vol	1
Issue	A
First Page	45
Last Page	49
Publication Type	Version of Record
Access Rights	open access
Related DOI	JMI ; 2009A-6
Related DOI	Journal of Math-for-Industry \|\| 1(A) \|\| p45-49
	JMI \|\| 1(A) \|\| p45-49
	http://gcoe-mi.jp/
Related URI	Journal of Math-for-Industry \|\| 1(A) \|\| p45-49
	JMI \|\| 1(A) \|\| p45-49
	http://gcoe-mi.jp/
Relation	JMI ; 2009A-6
	Journal of Math-for-Industry \|\| 1(A) \|\| p45-49
	JMI \|\| 1(A) \|\| p45-49
	http://gcoe-mi.jp/
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

File	FileType	Size	Views	Description
JMI2009A-6	pdf	157 KB	214

Record ID	13973
Peer-Reviewed	Refereed
Subject Terms	composite integer n = pq
	prime number theorem
	RSA cryptosystem
Notes	MI: Global COE Program Education-and-Research Hub for Mathematics-for-Industry
Notes	グローバルCOEプログラム「マス･フォア･インダストリ教育研究拠点」
Type	学術雑誌論文
Created Date	2009.10.20
Modified Date	2019.08.29