Gauss circle problem over smooth integers
New York Journal of Mathematics
2024
- 72Usage
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage72
- Downloads54
- Abstract Views18
Article Description
For a positive integer , let 2( ) be the number of representations of as sums of two squares (of integers), where the convention is that different signs and different orders of the summands yield distinct representations. A famous result of Gauss shows that ( ) ∶= ∑ ≤ 2( ) ∼ . Let ( ) denote the largest prime factor of and let ( , ) ∶= { ≤ ∶ ( ) ≤ }. In this paper, we study the asymptotic behavior of ( , ) ∶= ∑ ∈ ( , ) 2( ) for various ranges of 2 ≤ ≤ . For in a certain large range, we show that ( , ) ∼ ( ) ⋅ where ( ) is the Dickman function and = log ∕ log . We also obtain the asymptotic behavior of the partial sum of a generalized representation function following a method of Selberg.
Bibliographic Details
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know