An algorithm for counting smooth integers

dc.contributor.author	Ishmukhametov S.
dc.contributor.author	Sharifullina F.
dc.date.accessioned	2018-09-19T22:09:32Z
dc.date.available	2018-09-19T22:09:32Z
dc.date.issued	2016
dc.identifier.issn	1995-0802
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/144779
dc.description.abstract	© 2016, Pleiades Publishing, Ltd.An integer number n > 0 is called y-smooth for y > 0 if any prime factor p of n satisfies p ≤ y. Let ψ(x, y) be the number of all y-smooth integers less or equal to x. In this paper we elaborate a new algorithm for approximate calculation of ψ(x, y) at large x and relatively small y < log x.
dc.relation.ispartofseries	Lobachevskii Journal of Mathematics
dc.subject	calculation of smooths
dc.subject	Dickman–de Bruijn function
dc.subject	distribution of smooths
dc.subject	Smooth integers
dc.title	An algorithm for counting smooth integers
dc.type	Article
dc.relation.ispartofseries-issue	2
dc.relation.ispartofseries-volume	37
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	128
dc.source.id	SCOPUS19950802-2016-37-2-SID84962633503

Files in this item

Size: 44.15Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.