scholarly journals A new proof of Halász’s theorem, and its consequences

2018 ◽  
Vol 155 (1) ◽  
pp. 126-163 ◽  
Author(s):  
Andrew Granville ◽  
Adam J. Harper ◽  
K. Soundararajan

Halász’s theorem gives an upper bound for the mean value of a multiplicative function$f$. The bound is sharp for general such$f$, and, in particular, it implies that a multiplicative function with$|f(n)|\leqslant 1$has either mean value$0$, or is ‘close to’$n^{it}$for some fixed$t$. The proofs in the current literature have certain features that are difficult to motivate and which are not particularly flexible. In this article we supply a different, more flexible, proof, which indicates how one might obtain asymptotics, and can be modified to treat short intervals and arithmetic progressions. We use these results to obtain new, arguably simpler, proofs that there are always primes in short intervals (Hoheisel’s theorem), and that there are always primes near to the start of an arithmetic progression (Linnik’s theorem).

2019 ◽  
Author(s):  
V Kumar Murty

International audience A result of Barban-Vehov (and independently Motohashi) gives an estimate for the mean square of a sequence related to Selberg's sieve. This upper bound was refined to an asymptotic formula by S. Graham in 1978. In 1992, I made the observation that Graham's method can be used to obtain an asymptotic formula when the sum is restricted to an arithmetic progression. This formula immediately gives a version of the Brun-Titchmarsh theorem. I am taking the occasion of a volume in honour of my friend S. Srinivasan to revisit and publish this observation in the hope that it might still be of interest.


2019 ◽  
Vol 62 (1) ◽  
pp. 187-199
Author(s):  
PAUL POLLACK

AbstractAn oft-cited result of Peter Shiu bounds the mean value of a nonnegative multiplicative function over a coprime arithmetic progression. We prove a variant where the arithmetic progression is replaced by a sifted set. As an application, we show that the normalized square roots of −1 (mod m) are equidistributed (mod 1) as m runs through the shifted primes q − 1.


2013 ◽  
Vol 09 (04) ◽  
pp. 813-843 ◽  
Author(s):  
GREG MARTIN ◽  
NATHAN NG

Let L(s, χ) be a fixed Dirichlet L-function. Given a vertical arithmetic progression of T points on the line ℜs = ½, we show that at least cT/ log T of them are not zeros of L(s, χ) (for some positive constant c). This result provides some theoretical evidence towards the conjecture that all nonnegative ordinates of zeros of Dirichlet L-functions are linearly independent over the rationals. We also establish an upper bound (depending upon the progression) for the first member of the arithmetic progression that is not a zero of L(s, χ).


2003 ◽  
Vol 55 (6) ◽  
pp. 1191-1230 ◽  
Author(s):  
Andrew Granville ◽  
K. Soundararajan

AbstractFor given multiplicative function f , with |f(n)| ≤ 1 for all n, we are interested in how fast its mean value (1/x) Σn≤xf(n) converges. Halász showed that this depends on the minimum M (over y ∈ ℝ) of Σp≤x (1 – Re(f(p)p–iy )/p, and subsequent authors gave the upper bound ⪡ (1 + M)e–M. For many applications it is necessary to have explicit constants in this and various related bounds, and we provide these via our own variant of the Halász-Montgomery lemma (in fact the constant we give is best possible up to a factor of 10). We also develop a new type of hybrid bound in terms of the location of the absolute value of y that minimizes the sum above. As one application we give bounds for the least representatives of the cosets of the k-th powers mod p.


2018 ◽  
Vol 13 (03) ◽  
pp. 2050062
Author(s):  
Meselem Karras ◽  
Abdallah Derbal

Let [Formula: see text] be a fixed integer, we define the multiplicative function [Formula: see text], where [Formula: see text] is the Piltz divisor function and [Formula: see text] is the unitary analogue function of [Formula: see text]. The main purpose of this paper to use elementary methods to study the mean value of the function [Formula: see text].


1987 ◽  
Vol 39 (3) ◽  
pp. 646-672 ◽  
Author(s):  
Adolf Hildebrand

A central problem in probabilistic number theory is to evaluate asymptotically the partial sumsof multiplicative functions f and, in particular, to find conditions for the existence of the “mean value”1.1In the last two decades considerable progress has been made on this problem, and the results obtained are very satisfactory.


2008 ◽  
Vol 04 (02) ◽  
pp. 241-248 ◽  
Author(s):  
GLYN HARMAN

It is shown that Watt's new mean value theorem on sums of character sums can be included in the method described in the author's recent work [6] to show that the number of Carmichael numbers up to x exceeds x⅓ for all large x. This is done by comparing the application of Watt's original version of his mean value theorem [8] to the problem of primes in short intervals [3] with the problem of finding "small" primes in an arithmetic progression.


Sign in / Sign up

Export Citation Format

Share Document