On S~rne Applkations ~,f Brun's Method')

  • P Erd~s In Syracuse

Abstract

Denote by P(k, l) the least prime in the arithmetic progression kx+I. Subsequently we' shall aLways assume 0 < I < k, (I, k) = 1. TuRAN~) .proved that under assumption of the generalised RIEMANN hypothesis we have for every fixed positive E P(k, 1) < k (log k)2+-except possible for o (y(Q) progressions. He also remarks that it immediately follows from the… (More)

Topics

  • Presentations referencing similar topics