Representation of prime powers in arithmetical progressions by binary quadratic forms. (Q1424576)

Very fine details are given for \textit{A. Meyer's} theorem that each genus of binary quadratic (primitive) forms represents infinitely many primes in any arithmetic progression [Über einen Satz von Dirichlet, J. Reine Angew. Math. 103, 98--117 (1888; JFM 20.0192.02)]. Of course, \(p^m\) may be so represented even if \(p\) is not. The author carefully details the result with a review of establishing densities and conditions on \(m\).