Sums of arithmetic functions over values of binary forms
R. de la Breteche, T. D. Browning
Abstract
Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the coefficients of F is made completely explicit.
Create a lesson
Related papers
Almost primes in short intervals and averages of long Dirichlet polynomial approximations to (ζ'/ζ)k
Siegfred Baluyot, John Brian Conrey, Ayesha Irfan et al.
On the Diophantine equation Cx2+p12m1p22m2·s pk2mk=yq
Usha K. Sangale, Priyanka R. Satpute
Asymptotics for partitions over the Fibonacci numbers and related sequences, II
Michael Coons, Simon Kristensen, Mathias L. Laursen
Inverse powers and 2-adic properties of binary 3 x 3 matrices associated with the Tribonacci sequence
Wilson Arley Martinez, Samin Ingrith Ceron
Counting irreducible skew polynomials x2n+axn+1
Tomoya Hayata, Takahiro Tsushima
Finding Integer Roots of Polynomials in Nearly Optimal Time
Yansong Feng, Itamar Nir