“…holds for y x 1 2r+1 +ε where r is given in (1). The purpose of this work is to establish an effective version of Zhai's result by giving a fully effective error term.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…A prime-independent multiplicative function is a multiplicative arithmetic function f satisfying f (1) = 1 and such that there exists a map g : Z 0 −→ R such that g(0) = 1 and, for any prime powers p α f (p α ) = g(α). In this article, we only consider integer-valued prime-independent multiplicative functions f verifying f (p) = 1 for any prime p. This is equivalent to the fact that g(1) = 1 and we also assume that there exists r ∈ Z 2 such that (1) g(1) = · · · = g(r − 1) = 1 and α r ⇒ g(α) > 1.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…Theorem 1. Let k ∈ Z 1 fixed and f be an integer-valued prime-independent multiplicative function such that f (p) = 1 for any prime p and let r ∈ Z 2 as in (1). Let r(3r−1) x ε .…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…In what follows, k ∈ Z 1 is fixed and f is an integer-valued prime-independent multiplicative function satisfying the hypothesis of Theorem 1, with r ∈ Z 2 given in (1).…”
Section: Notation and Preparation For The Proofmentioning
Abstract. Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued primeindependent multiplicative functions.
“…holds for y x 1 2r+1 +ε where r is given in (1). The purpose of this work is to establish an effective version of Zhai's result by giving a fully effective error term.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…A prime-independent multiplicative function is a multiplicative arithmetic function f satisfying f (1) = 1 and such that there exists a map g : Z 0 −→ R such that g(0) = 1 and, for any prime powers p α f (p α ) = g(α). In this article, we only consider integer-valued prime-independent multiplicative functions f verifying f (p) = 1 for any prime p. This is equivalent to the fact that g(1) = 1 and we also assume that there exists r ∈ Z 2 such that (1) g(1) = · · · = g(r − 1) = 1 and α r ⇒ g(α) > 1.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…Theorem 1. Let k ∈ Z 1 fixed and f be an integer-valued prime-independent multiplicative function such that f (p) = 1 for any prime p and let r ∈ Z 2 as in (1). Let r(3r−1) x ε .…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…In what follows, k ∈ Z 1 is fixed and f is an integer-valued prime-independent multiplicative function satisfying the hypothesis of Theorem 1, with r ∈ Z 2 given in (1).…”
Section: Notation and Preparation For The Proofmentioning
Abstract. Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued primeindependent multiplicative functions.
“…For multiplicative functions F such that F (p) is close to 1 for every prime p, another method was developed in [2] using profound theorems from Filaseta-Trifonov and Huxley-Sargos results on integer points near certain smooth curves. This leads to very precise estimates of a large class of multiplicative functions.…”
Abstract. Using estimates on Hooley's ∆-function and a short interval version of the celebrated Dirichlet hyperbola principle, we derive an asymptotic formula for a class of arithmetic functions over short segments. Numerous examples are also given.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.