The [Bombieri-Vinogradov Theorem](http://en.wikipedia.org/wiki/Bombieri%E2%80%93Vinogradov_theorem) states that given $A>0$, there exists $B>0$ such that for $Q=\sqrt{x}\left(\log x\right)^{-B},$ we have $$\sum\_{q\leq Q}\max\_{y\leq x}\max\_{\begin{array}{c}
a\text{ mod q}\\
(a,q)=1
\end{array}}\left|\psi(y;q,a)-\frac{y}{\phi(q)}\right|\ll \frac{x}{(\log x)^A}.$$ 


I was wondering what happens if a restriction is put on the $q$ so that they are all divisible by some smaller integer $k$. Are there any non-trivial bounds on the average over $q$ divisible by $k$? Specifically, suppose that $k\leq Q^{1-\epsilon},$ and that there is no [Siegel zero](http://en.wikipedia.org/wiki/Siegel_zero)${}^{++}$ for any $\chi$ modulo $k$. Is it true that $$\sum\_{\begin{array}{c}
q\leq Q\\
k|q
\end{array}}\max\_{y\leq x}\max\_{\begin{array}{c}
a\text{ mod q}\\
(a,q)=1
\end{array}}\left|\psi(y;q,a)-\frac{y}{\phi(q)}\right|\ll\_{\epsilon}\frac{1}{k} \frac{x}{(\log x)^A}.$$ 


Any references would be greatly appreciated.


Thanks for your help,


${}^{++}$ **Edit:** As mentioned by Terence Tao in the comments, there is an issue regarding Siegel zeros modulo $k$. The original result I was asking about would give stronger bounds on the location of a possible Siegel zero modulo $k$, and for that reason it is out of reach. 


I worked out a sketch/heuristic, as suggested by Terence Tao's comment, for why we have to assume that there are no Siegel zeros modulo $k$. I wrote this mainly for my own understanding, and I have added it here for anyone who is interested. I would still like to know if the result holds assuming there are no non-trivial real zeros for $\chi$ mod $k$. 



> 
> **Heuristic:** Suppose that $k$ is a small power of $x$. If there is an exceptional zero $\beta$ for a quadratic character $\chi$ modulo $k$ , then for every $q$ such that $k|q,$ the induced character modulo $q,$ $\chi^{\star},$ will have the same exceptional zero, and so we expect that $$\psi(x;q,a)\approx\frac{x}{\phi(q)}-\frac{\chi^{\star}(a)}{\phi(q)}\frac{x^{\beta}}{\beta}+small$$ for each $q.$ This leads us to expect that $$\sum\_{\begin{array}{c}
> q\leq Q\\
> k|q
> \end{array}}\max\_{y\leq x}\max\_{a\text{ mod }q}\left|\psi\left(y;q,a\right)-\frac{y}{\phi(q)}\right|\approx x^{\beta}\sum\_{\begin{array}{c}
> q\leq Q\\
> k|q
> \end{array}}\frac{1}{\phi(q)}\approx\frac{x^{\beta}\log x}{k},$$ however, the desired upper bound is too strong, as $$x^{\beta}\log x\ll \frac{x}{\left(\log x\right)^{B}},$$ implies that for some $C>0$, $$\beta\leq1-C\frac{\log\log x}{\log x},$$ which is stronger than the long standing bound by Siegel $$\beta\leq1-C(\epsilon)x^{-\epsilon}.$$ In the above, we have used $x$ interchangeably with $k$ for the bounds since $k$ is a small power of $x$.
> 
> 
> 



The Bombieri Vinogradov Theorem restricted to moduli divisible by $k$
[Elliott has a result](http://www.ams.org/mathscinet-getitem?mr=2281164) in this direction. Let $A>0$ and $a \geq 2$ a fixed integer. Furthermore, let $q \leq x^{1/3-\epsilon} $ be a large power of $a$. One then has that
$$ \sum\_{\substack{d \leq q^{-1}x^{1/2} \log^{-A-6}(x) \\ (d,q)=1 }} \max\_{(r,qd)=1} \max\_{y\leq x} \left|\pi(y,qd,r) - \frac{\text{Li}(y)}{\phi(qd)} \right| \ll\_{A} \frac{x}{\phi(q) \log^{A}(x) } .$$ 
Taking $d=1$ recovers the Bombieri-Vinogradov theorem. Note that while Bombieri-Vinogradov doesn't contain any information about specific arithmetic progressions with modulus larger than $\log^{A}(x)$, Elliott's inequality implies that 
$$\pi(x,q,r) \sim \frac{Li(x)}{\phi(q)}$$ 
for $q \leq x^{1/3-\epsilon}$ that is a large power of $a$.


