Multiple Mertens theorems for arithmetic progressions

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive asymptotic expansions for the sums ${\sum }_{\begin{array}{c}{p}_1\cdots p_n\le x\\ p_i\equiv h_i(\mathrm{m}\mathrm{o}\mathrm{d}{m}_i)\\ i=1,\dots ,n\end{array}}\frac{1}{p_1\cdots p_n}$ and the corresponding log-weighted sums. A key feature of our results is that the error terms hold \emph{uniformly} for moduli satisfying $m_i\le (\log x{)}^K$, a range accessible via the Siegel-Walfisz theorem. Furthermore, we identify the coefficients of the asymptotic expansion with the Taylor series of the reciprocal Gamma function, $1\mathrm{/}\mathrm{\Gamma }(z)$, providing a structural explanation for the lower-order terms.