A sieve problem and its application

Abstract: Let

h e t a

be an arithmetic function and let

m a t h c a l B

be the set of positive integers

n = p_{1}^{a l p h a_{1}} c d o t s p_{k}^{a l p h a_{k}}

, which satisfy

p_{j + 1} l e h e t a (p_{1}^{a l p h a_{1}} c d o t s p_{j}^{a l p h a_{j}})

for

0 l e j < k

. We show that

m a t h c a l B

has a natural density, provide a criterion to determine whether this density is positive, and give various estimates for the counting function of

m a t h c a l B

. When

h e t a (n) / n

is non-decreasing, the set

m a t h c a l B

coincides with the set of integers

n

whose divisors

1 = d_{1} < d_{2} < l d o t s < d_{a u (n)} = n

satisfy

d_{j + 1} l e h e t a (d_{j})

for

1 l e j < a u (n)

.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: A sieve problem and its application