Some estimates for the average of the error term of the Mertens product for arithmetic progressions (Q1032767)

Write \[ P(x;q,a)=\prod_{\substack{ p\leq x\\ p\equiv a\bmod q}} \bigg(1-\frac{1}{p}\bigg), \] and \[ M(x;q,a)=\frac{C(q,a)}{(\log x)^{1/\varphi(q)}}, \] where \(C(q,a)>0, \;\varphi\) is the Euler totient function. The following results are obtained Theorem 1. For every \( A > 0\), there exists \(B = B(A) > 0\) such that \[ \sum_{q\leq Q}\max_{(a,q)=1}\bigg|\log\frac{P(x; q, a)} {M(x; q, a)}\bigg| \ll (\log x)^{-A} \] where \(Q = x^{1/2}(\log x)^{-B}.\) Theorem 2. For every \( A > 0\), there exists \(B = B(A) > 0\) such that \[ \sum_{q\leq Q}\sum_{(a,q)=1}\bigg(\log\frac{P(x; q, a)} {M(x; q, a)}\bigg)^{2} \ll (\log x)^{-A} \] where \(Q = x(\log x)^{-B}\). The proofs use the Bombieri-Vinogradov theorem for primes in arithmetic progressions.