An algorithm for counting smooth integers
- Авторы: Ishmukhametov S.1, Sharifullina F.1
-
Учреждения:
- Kazan Federal University
- Выпуск: Том 37, № 2 (2016)
- Страницы: 128-137
- Раздел: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/197396
- DOI: https://doi.org/10.1134/S1995080216020062
- ID: 197396
Цитировать
Аннотация
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.
Об авторах
S. Ishmukhametov
Kazan Federal University
Автор, ответственный за переписку.
Email: ishm@nextmail.ru
Россия, Kremlevskaya ul. 18, Kazan, 420111
F. Sharifullina
Kazan Federal University
Email: ishm@nextmail.ru
Россия, Kremlevskaya ul. 18, Kazan, 420111