On the asymptotic distribution of the powers of -matrices
The arithmetic function counts the number of ways to write a natural number n as a sum of two kth powers (k ≥ 2 fixed). The investigation of the asymptotic behaviour of the Dirichlet summatory function of leads in a natural way to a certain error term which is known to be in mean-square. In this article it is proved that as t → ∞. Furthermore, it is shown that a similar result would be true for every fixed k > 3 provided that a certain set of algebraic numbers contains a sufficiently...
Page 1