20100404, 17:34  #1 
6,803 Posts 
nth prime number in an arithmetic progression
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 ? joseph 
20100404, 22:06  #2  
Aug 2006
3×1,993 Posts 
Quote:
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 http://www.math.ucla.edu/~tao/prepri...itative_AP.dvi Last fiddled with by CRGreathouse on 20100404 at 22:06 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Prime Numbers as a Function of a Geometric Progression  danupp  And now for something completely different  2  20171104 17:55 
Basic Number Theory 16: unit group structure in modular arithmetic  Nick  Number Theory Discussion Group  0  20170119 20:22 
Basic Number Theory 5: rationals & intro to modular arithmetic  Nick  Number Theory Discussion Group  1  20161021 22:21 
Bertrand's Theorem for Arithmetic Progression  literka  Math  0  20130601 12:42 
Arithmetic and Polynomial Progression of Primes?  drake2  Math  13  20061010 00:43 