![]() |
![]() |
#1 |
"William"
May 2003
Near Grandkid
237410 Posts |
![]()
Is there a known correction term to the density primes being 1/ln(x)? There are well known improvements to the nth prime being n*ln(n), but I think these are mostly improved approximations for the Log Integral (Li). What I'm asking about would be an improved integrand for the Log Integral.
I know this isn't stated in a mathematically rigorous manner, but I think the question is clear enough. |
![]() |
![]() |
![]() |
#2 |
Aug 2006
5,987 Posts |
![]() |
![]() |
![]() |
![]() |
#3 | |
"Bob Silverman"
Nov 2003
North of Boston
11101010101002 Posts |
![]() Quote:
short interval. Cramer's conjecture asserts the existence of a prime in the (short) interval x, x + O(log^2 x), but says nothing about how many there are. |
|
![]() |
![]() |
![]() |
#4 |
Dec 2008
you know...around...
853 Posts |
![]()
I was on that too and came up with 1/ln(x+1/2*ln(x)*sqrt(x)) (ln being the natural logarithm here, as being used in the OP) which was met with about the same criticism as in this thread.
Sure, I understand why this is a moot point, but there are some numerical and heuristical indications... Last fiddled with by mart_r on 2011-07-25 at 20:47 |
![]() |
![]() |
![]() |
#5 |
Jun 2011
Henlopen Acres, Delaware
8516 Posts |
![]() |
![]() |
![]() |
![]() |
#6 | |
Dec 2009
33 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#7 |
Aug 2006
5,987 Posts |
![]()
Arkadiusz, I didn't realize you posted here! (Or lurked, as the case may be.)
|
![]() |
![]() |
![]() |
#8 | |
Aug 2006
176316 Posts |
![]() Quote:
As an example, between 10^10 and 10^10 + 10^7 the standard 1/log x predicts 434,285 primes, while this predicts 2 fewer. But there are 434,650, so the actual errors are 365 and 367. IIRC |pi(x) - li(x)| is known to be >> sqrt(x)/log x infinitely often, while under RH it's << sqrt(x) log x. So it's a priori possible that the correction could be meaningful, but I'm not holding my breath. |
|
![]() |
![]() |
![]() |
#9 |
Dec 2008
you know...around...
853 Posts |
![]()
Just this question:
Does the Riemann prime counting formula / RH if true imply that |
![]() |
![]() |
![]() |
#10 |
May 2003
30138 Posts |
![]()
William,
I just noticed this question. I'll take a look at my files on this when I get back to work on Tuesday. (If you don't hear from me, remind me.) |
![]() |
![]() |
![]() |
#11 |
Aug 2006
5,987 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
@ Supermods: Error Correction please | Raman | Forum Feedback | 72 | 2013-06-22 07:24 |
Asymptotic density of k-almost primes | CRGreathouse | Math | 1 | 2010-08-22 23:47 |
Prime k-value density rating and factorizations | gd_barnes | No Prime Left Behind | 25 | 2009-07-30 12:06 |
Density of Mersenne divisors | Random Poster | Math | 1 | 2008-12-15 01:14 |
prime density vs. sieving vs. prp time | jasong | Math | 18 | 2006-03-31 03:14 |