The average order of two arithmetical functions (Q5585476)
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 3304126
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The average order of two arithmetical functions |
scientific article; zbMATH DE number 3304126 |
Statements
The average order of two arithmetical functions (English)
0 references
1969
0 references
0.96710205
0 references
0.9561006
0 references
0.8917502
0 references
0.8863485
0 references
0.8847261
0 references
Let \(F(k)\) denote an arithmetic function which satisfies certain conditions to ensure that the values of \(k\) for which \(F(k)\) is large are connected in a simple way with the distribution of the primes. Then it is shown that the sum \(\sum_{k\leq N} F(k)\) is asymptotic to a certain multiple sum which can be evaluated in two particular cases. First the function \(\Gamma^*(k)\), defined to be the least \(s\) such that the congruence \[ a_1x_1^k+\ldots+ a_sx_s^k \equiv 0\pmod {p^n}, \] where \(a_1,\ldots,a_s\) are arbitrary non-zero integers, has a non-trivial solution for every prime power \(p^n\), satisfies the condition required for the above result and the sum \(\sum_{k\leq N} \Gamma^*(k)\) is asymptotic to \(\pi^2N^3/18\log n\), which implies that the average order for \(\Gamma^*(k)\) is \(\pi^2k^2/6\log k\). Secondly the function \(\Gamma(k)\), defined to be the least \(s\) such that the congruence \[ x_1^k+\ldots+x_s^k \equiv N\pmod {p^n}, \] has a non-trivial solution for very integer \(N\) and every prime power \(p^n\), also satisfies the conditions for the above result and the sum \(\sum_{k\leq N} \Gamma(k)\) is asymptotic to \(5\pi^2N^2/24 \log N\), and the average order of \(\Gamma(k)\) is \(5\pi^2k/12 \log k\).
0 references