Показать сокращенную информацию
dc.contributor.author | Ishmukhametov S. | |
dc.contributor.author | Sharifullina F. | |
dc.date.accessioned | 2018-09-18T20:17:17Z | |
dc.date.available | 2018-09-18T20:17:17Z | |
dc.date.issued | 2014 | |
dc.identifier.issn | 1066-369X | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/138327 | |
dc.description.abstract | A semiprime is a natural number which is the product of two (possibly equal) prime numbers. Let y be a natural number and g(y) be the probability for a number y to be semiprime. In this paper we derive an asymptotic formula to count g(y) for large y and evaluate its correctness for different y. We also introduce strongly semiprimes, i.e., numbers each of which is a product of two primes of large dimension, and investigate distribution of strongly semiprimes. © 2014 Allerton Press, Inc. | |
dc.relation.ispartofseries | Russian Mathematics | |
dc.subject | distribution of semiprimes | |
dc.subject | factorization of integers | |
dc.subject | semiprime integer | |
dc.subject | strongly semiprime | |
dc.subject | the RSA ciphering method | |
dc.title | On distribution of semiprime numbers | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 8 | |
dc.relation.ispartofseries-volume | 58 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 43 | |
dc.source.id | SCOPUS1066369X-2014-58-8-SID84904669217 |