On divisors of a quadratic form (Q4488747)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1471443
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On divisors of a quadratic form |
scientific article; zbMATH DE number 1471443 |
Statements
On divisors of a quadratic form (English)
0 references
12 March 2003
0 references
number of divisors
0 references
quadratic form
0 references
0.8699315190315247
0 references
0.8589334487915039
0 references
0.8375437259674072
0 references
0.8344079852104187
0 references
Let \(\tau(n)\) be the number of divisors of \(n\). The result of this paper is \[ A_{1}x^{3} + O(x^{2}\log x) < \sum_{1\leq n, m, t \leq x}\tau(n^2 + m^2 + t^2) - {8\over 5}{\zeta(3)\over \zeta(4)}x^{3}\log x < A_{2}x^3 + O(x^{2}\log x), \] with explicit values for \(A_1\) and \(A_2\) provided. The method can be summarized as follows. Let \(\rho(n)\) be the number of solutions to \(x^2 + y^2 + z^2 \equiv 0 (\bmod n), 1\leq x, y\), \(z\leq n\). Gauss sums are employed to find the value of \(\rho\) at the prime powers, leading to the expression \( \rho(n) = n^{2}\sum_{d^{2}|n}{g(d)\over d^2 }\). Here \(g(d) = \phi(d)\) if \(d\) is odd, and \(g(d) = -2\phi(d)\) if \(d\) is even. This allows one to calculate \[ \sum_{n\leq x}\rho(n) = {4\over 15}{\zeta(3)\over \zeta(4)}x^3 + O(x^{2}\log x) , \] from which the result quoted above is deduced.
0 references