Asymptotic formulae are provided for the number of representations of a natural number as the sum of four and of three squares that are pairwise coprime.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
A new method for counting primes in a Beatty sequence is proposed, and it is shown that an asymptotic formula can be obtained for the number of such primes in a short interval.
5
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW