New upper bounds for Ramanujan primes

From MaRDI portal
Publication:3177776




Abstract: For nge1, the nmth Ramanujan prime is defined as the smallest positive integer Rn such that for all xgeRn, the interval (fracx2,x] has at least n primes. We show that for every epsilon>0, there is a positive integer N such that if alpha=2nleft(1+dfraclog2+epsilonlogn+j(n)ight), then Rn<p[alpha] for all n>N, where pi is the imth prime and j(n)>0 is any function that satisfies j(n)oinfty and nj(n)o0.









This page was built for publication: New upper bounds for Ramanujan primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177776)