2006
DOI: 10.4064/aa123-4-7
|View full text |Cite
|
Sign up to set email alerts
|

On the moments of the Carmichael λ function

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…A slightly stronger lower bound appears in [1]. Stronger upper and lower bounds on #L 1 (x) will appear in [16]. While #L k (x) seems difficult to study for larger values of k, it is easy to see that the method of the present paper shows that uniformly for x large, #{λ k (n) : n ≤ x} ≤ x (log x) k exp 16k …”
Section: Theoremmentioning
confidence: 80%
“…A slightly stronger lower bound appears in [1]. Stronger upper and lower bounds on #L 1 (x) will appear in [16]. While #L k (x) seems difficult to study for larger values of k, it is easy to see that the method of the present paper shows that uniformly for x large, #{λ k (n) : n ≤ x} ≤ x (log x) k exp 16k …”
Section: Theoremmentioning
confidence: 80%
“…Then [10], p. 848, formulas (4) and (6)). We now follow [14], first of all by changing notation slightly (y in place of x). More importantly, we define a subset P * δ (y) of P δ (y) to eliminate large powerful divisors of p − 1.…”
Section: The Lower Boundmentioning
confidence: 99%
“…Condition LS1 excludes at most O(y/(log y) c+1 ) elements of P δ (y), and using Abel summation and (56), we see that LS2 excludes at most Next let R δ (y) be the set of all products of [y δ ] distinct elements of P * δ (y). As in [14], we will estimate |R δ…”
Section: The Lower Boundmentioning
confidence: 99%
See 2 more Smart Citations