On sums of five almost equal prime squares
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...
Under the Generalized Riemann Hypothesis, it is proved that for any there is depending on only such that every even integer is a sum of two odd primes and powers of .
A certain generalized divisor function is studied which counts the number of factorizations of a natural number into integer powers with prescribed exponents under certain congruence restrictions. An -estimate is established for the remainder term in the asymptotic for its Dirichlet summatory function.