In Elliot's book "Probabilistic Number Theory", there seems to be an inaccuracy. The author defines, for any sequence $a\_n$, the quantity


$$V(p)=\sum\_{r=0}^{p-1}\left|\sum\_{\substack{n=1 \\n \equiv r\mathrm{mod}(p)}}^N a\_n-p^{-1}\sum\_{n=1}^N a\_n
\right|^2$$


He then asserts that, if $a\_n$ assumes only the values 0,1, then


$$\sum\_{p\leq Q}pV(p)\leq c\_1 Q^2 \log(Q)\sum\_{n=1}^N|a\_n|^2$$


where $c\_1$ is some absolute constant. The issue is, this would imply that


$$\limsup\_{N\to\infty}\sum\_{p\leq Q}p\frac{V(p)}{N^2}\leq c\_1 Q^2 \log(Q)\limsup\_{N\to\infty}\frac{1}{N^2}\sum\_{n=1}^N|a\_n|^2=0$$


which isn't always true. An easy counter-example is $a\_n$ defined as $0$ when $n$ is even and $1$ when $n$ is odd, and $Q=2$. Namely, we have that


\begin{align\*}
\sum\_{p\leq Q}p\frac{V(p)}{N^2} &= 2\frac{V(2)}{N^2}\\
&=\frac{2}{N^2}\sum\_{r=0}^{1}\left|\sum\_{\substack{n=1 \\n \equiv r\mathrm{mod}(2)}}^N a\_n-\frac{1}{2}\sum\_{n=1}^N a\_n
\right|^2\\
&=2\sum\_{r=0}^{1}\left|\frac{1}{N}\sum\_{\substack{n=1 \\n \equiv r\mathrm{mod}(2)}}^N a\_n-\frac{1}{2N}\sum\_{n=1}^N a\_n\right|^2\\
&=2\left|\frac{1}{N}\sum\_{\substack{n=1 \\n \equiv 0\mathrm{mod}(2)}}^N a\_n-\frac{1}{2N}\sum\_{n=1}^N a\_n\right|^2+2\left|\frac{1}{N}\sum\_{\substack{n=1 \\n \equiv 1\mathrm{mod}(2)}}^N a\_n-\frac{1}{2N}\sum\_{n=1}^N a\_n
\right|^2\\
\end{align\*}


Since


$$\lim\_{N\to\infty}\frac{1}{2N}\sum\_{n=1}^Na\_n=\frac{1}{4}$$
$$\lim\_{N\to\infty}\frac{1}{N}\sum\_{\substack{n=1 \\n \equiv 1\mathrm{mod}(2)}}^N a\_n=\frac{1}{2}$$
$$\lim\_{N\to\infty}\frac{1}{N}\sum\_{\substack{n=1 \\n \equiv 0\mathrm{mod}(2)}}^N a\_n=0$$


We see that


$$\lim\_{N\to\infty}\sum\_{p\leq Q}\frac{V(p)}{N^2}=2\left(\frac{1}{4}\right)^2+2\left(\frac{1}{4}\right)^2=\frac{1}{8}$$


Numerical computations show that $\frac{1}{8} \neq 0$ and thus this is a contradiction. The paper cited for this result is locked behind a paywall so I cannot access it and see what the true theorem is. Does anyone know what the actual result should have been? Where is the typo?


The paper cited with the result is


*Roth, Klaus F.*, [**On the large sieves of Linnik and Renyi**](http://dx.doi.org/10.1112/S0025579300005088), Mathematika, Lond. 12, 1-9 (1965). [ZBL0137.25904](https://zbmath.org/?q=an:0137.25904).


SIDE QUESTION:


In the book, there are many inequalities given for the sum $\sum\_{p<Q}pV(p)$, but if you think about $V(p)$ as being on the order of $\frac{N^2}{p^2}$ for large $N,p$ (which is the worst-case scenario), then the sum $\sum\_{p<Q}p^2V(p)$ feels much more natural to study, and $\sum\_{p<Q}pV(p)$ feels like a logarithmically weighted version. Does anyone know of any inequalities for $\sum\_{p<Q}p^2V(p)$?



A possible error in Elliot's book "Probabilistic Number Theory"
You are right that the second display is false in general (Elliott might impose some conditions). The following version is well-known, and a consequence of Selberg's optimized large sieve inequality:
$$\sum\_{p\leq Q}pV(p)\leq (N+Q^2-1)\sum\_{n=1}^N|a\_n|^2.$$
This holds for any complex numbers $a\_n$. See (23) in [Montgomery: The analytic principle of the large sieve](https://projecteuclid.org/euclid.bams/1183540922). Well, Montgomery has $N+Q^2$ instead of $N+Q^2-1$, but the latter is also valid in the light of Theorem 3 in Montgomery's survey.


