Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-07T12:17:27.798Z Has data issue: false hasContentIssue false

A SIEVE PROBLEM AND ITS APPLICATION

Published online by Cambridge University Press:  27 September 2016

Andreas Weingartner*
Affiliation:
Department of Mathematics, Southern Utah University, 351 West University Boulevard, Cedar City, UT 84720, U.S.A. email weingartner@suu.edu
Get access

Abstract

Let $\unicode[STIX]{x1D703}$ be an arithmetic function and let ${\mathcal{B}}$ be the set of positive integers $n=p_{1}^{\unicode[STIX]{x1D6FC}_{1}}\cdots p_{k}^{\unicode[STIX]{x1D6FC}_{k}}$ which satisfy $p_{j+1}\leqslant \unicode[STIX]{x1D703}(p_{1}^{\unicode[STIX]{x1D6FC}_{1}}\cdots p_{j}^{\unicode[STIX]{x1D6FC}_{j}})$ for $0\leqslant j<k$ . We show that ${\mathcal{B}}$ has a natural density, provide a criterion to determine whether this density is positive, and give various estimates for the counting function of ${\mathcal{B}}$ . When $\unicode[STIX]{x1D703}(n)/n$ is non-decreasing, the set ${\mathcal{B}}$ coincides with the set of integers $n$ whose divisors $1=d_{1}<d_{2}<\cdots <d_{\unicode[STIX]{x1D70F}(n)}=n$ satisfy $d_{j+1}\leqslant \unicode[STIX]{x1D703}(d_{j})$ for $1\leqslant j<\unicode[STIX]{x1D70F}(n)$ .

Information

Type
Research Article
Copyright
Copyright © University College London 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable