The Least Prime Congruent to One Modulo n

Abstract

It is known that there are infinitely many primes congruent to 1 (mod n) for any integer n > 1. In this paper, we use an elementary argument to prove that the least such prime is at most 2ϕ(n) + 1 −1, where ϕ is the Euler totient function.