View Single Post
Old 2010-04-04, 22:06   #2
CRGreathouse's Avatar
Aug 2006

597910 Posts

Originally Posted by Unregistered View Post
It is well known that the number of primes in the arithmetic progression a, a + b, a + 2b, a + 3b , , , less than x is xlog(x)/phi(b).

Is there any good approximations (need lower bound acturally) for the nth prime number in this arithmetic progression ?
If I understand your question correctly:

This is a very hard question, but Ben Green and Terry Tao show that such progressions are Ω(log log log log log log log x). See

Last fiddled with by CRGreathouse on 2010-04-04 at 22:06
CRGreathouse is offline   Reply With Quote