An Elementary Proof of the Prime-Number Theorem for Arithmetic Progressions

Abstract

In this paper we shall give an elementary proof of the theorem (1.1) where φ(k) denotes Euler's function, and (1.2) where p denotes the prime, and and are integers with (,) = 1, positive.