For given multiplicative function $f$, with $\left| f\left( n \right) \right|\le 1$ for all $n$, we are interested in how fast its mean value $\left( 1/x \right)\sum{_{n\le x}f\left( n \right)}$ converges. Halász showed that this depends on the minimum $M\,\left( \text{over}\,y\,\in \,\mathbb{R} \right)\,\text{of}\,\sum{_{p\le x}\left( 1-\operatorname{Re}\left( f\left( p \right){{p}^{-iy}} \right) \right)}/p$, and subsequent authors gave the upper bound $\ll \left( 1+M \right){{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$.

Let f be an additive arithmetical function having a distribution F. For any sequence let

In this note, we determine the slowest growing function b so that Qn{b, f) tends weakly to F, for various f.

The representation of integers by the products and quotients of the values of x(x2 + a) at integer points is considered.