2005
DOI: 10.1093/qmath/hah039
|View full text |Cite
|
Sign up to set email alerts
|

Values of arithmetical functions equal to a sum of two squares

Abstract: Let wðnÞ denote the Euler function. In this paper, we determine the order of growth for the number of positive integers n # x for which wðnÞ is the sum of two square numbers. We also obtain similar results for the Dedekind function cðnÞ and the sum of divisors function sðnÞ:

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 7 publications
0
8
0
Order By: Relevance
“…Now, given a large real number x, let y be defined implicitly by the equation x = exp 7s 1/2 log y , where s is defined as in (6). Then N T ≤ x holds for all such subsets T , provided that x is sufficiently large.…”
Section: Notationmentioning
confidence: 99%
See 1 more Smart Citation
“…Now, given a large real number x, let y be defined implicitly by the equation x = exp 7s 1/2 log y , where s is defined as in (6). Then N T ≤ x holds for all such subsets T , provided that x is sufficiently large.…”
Section: Notationmentioning
confidence: 99%
“…For a variety of other results with a similar flavor, we refer the reader to [3,4,5,6,8,10,12,13,21,22,23,24,26,33,34,40,42,45,49] and the references contained therein.…”
Section: Introductionmentioning
confidence: 99%
“…Most of our notation is standard, or will be introduced as necessary, but one exception is worth highlighting. For the remainder of the paper , we adopt the following convention for logarithms and iterated logarithms, borrowed from [3]. We write lnx$\ln {x}$ for the usual natural logarithm and we set logx:=maxfalse{2,lnxfalse}.\begin{equation*} \log x := \max \lbrace 2,\ln x\rbrace .…”
Section: Introductionmentioning
confidence: 99%
“…The estimates (1) and (2) remain valid with (see [2, pp. 31, 43] and [4,Theorem 2]), and it is straightforward to prove that Theorem 1 also holds for . (See the remarks following the proof of the Theorem 3, which is a generalization of Theorem 1.)…”
Section: Introductionmentioning
confidence: 99%
“…(See the remarks following the proof of the Theorem 3, which is a generalization of Theorem 1.) One can also show that (1) and (2) hold with ' replaced by (see [2,Theorem 6.3 and §7] and [3]). For sums of three squares, we can prove the following:…”
Section: Introductionmentioning
confidence: 99%