1988
DOI: 10.4064/aa-50-2-107-118
|View full text |Cite
|
Sign up to set email alerts
|

On the error function in the asymptotic formula for the counting function of k-full numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

1994
1994
2020
2020

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(27 citation statements)
references
References 0 publications
0
27
0
Order By: Relevance
“…The conclusion from this result to Theorem 1 is easy and has many analogues in the literature; see [1,9,10]. Nevertheless, we supply the details for convenience of the reader.…”
Section: Propositionmentioning
confidence: 71%
See 1 more Smart Citation
“…The conclusion from this result to Theorem 1 is easy and has many analogues in the literature; see [1,9,10]. Nevertheless, we supply the details for convenience of the reader.…”
Section: Propositionmentioning
confidence: 71%
“…For any arithmetic function H ∈ C with a generating function F H ( ) according to (1), it holds true that, as → ∞,…”
Section: Theoremmentioning
confidence: 99%
“…Note that our X = (log T ) 8/δ . The horizontal portions contribute an error which is (log T )X δ/4 e −(log T ) 3 1 because of the presence of the Γ (w) in the integrand, whereas the vertical line integral on u = −δ/8 contributes an error which is (log T )X −δ/8 1 with our choice of X. Note that…”
Section: Proof Of Lemma 32mentioning
confidence: 91%
“…We note here that an analogue of Theorem A for the "sums of two squares" function r(n) was dealt with by M. Kühleitner (see [7]). We also refer to the related papers [2], [3], [12] and [20].…”
Section: Introductionmentioning
confidence: 99%
“…For some more general interesting results, we refer to for example [1], [2], [3] and [23]; we also mention some related references [4], [14] and [27].…”
Section: Introductionmentioning
confidence: 99%