A. S. Rybakov, “A modification of an algorithm for estimating the cardinality of integers with no more than three prime divisors”, Mat. Vopr. Kriptogr., 2013, Volume 4, Issue 3,Pages <nobr>131

This article is cited in 2 papers

A modification of an algorithm for estimating the cardinality of integers with no more than three prime divisors

A. S. Rybakov

TPA Laboratory, Moscow

Abstract: We suggest fast computational methods for some generalizations of the Dickman function used to estimate the cardinality of the set of integers in an interval having no more than three prime divisors.

Key words: smooth and semi-smooth numbers, Dickman function, integral representations, quickly convergent series.

UDC: 511.333

Received 20.IV.2012

DOI: 10.4213/mvk95