On the Number of Restricted Prime Factors of an Integer II

Publication date 6 April 2016

Abstract: Given a partition

E_{0}, l d o t s, E_{n}

of the set of primes and a vector

m a t h b f k i n m a t h b b N_{0}^{n + 1}

, we compute an asymptotic formula for the quantity

| m l e q x : o m e g a_{E_{j}} (m) = k_{j} f o r a l l 0 l e q j l e q n |

uniformly in a wide range of the parameters

k_{j}

that complements the results of a previous paper of the author. This is accomplished using an extension and generalization of a theorem of Wirsing due to the author that gives explicit estimates for the ratio

f r a c | M_{g} (x) | M_{f} (x)

, whenever

f : m a t h b b N i g h t a r r o w (0, i n f t y)

and

g : m a t h b b N i g h t a r r o w m a t h b b C

are strongly multiplicative functions that are uniformly bounded on primes and satisfy

| g (n) | l e q f (n)

for every

n i n m a t h b b N

. This also allows us to conclude the validity of a probabilistic heuristic regarding

p i (x; m a t h b f E, m a t h b f k)

in the case that

k_{j} = (1 + o (1)) E_{j} (x)

, for each

0 l e q j l e q n

.

This page was built for publication: On the Number of Restricted Prime Factors of an Integer II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6272258)