mersenneforum.org > Math Asymptotic density of k-almost primes
 Register FAQ Search Today's Posts Mark Forums Read

 2010-08-16, 20:12 #1 CRGreathouse     Aug 2006 3·1,993 Posts Asymptotic density of k-almost primes Of course this is $\pi_k(n)=\frac{n(\log\log n)^{k-1}}{(k-1)!\log n}+o\left(\frac{n(\log\log n)^{k-1}}{\log n}\right)$ for any fixed k, but are there better Li-type estimates, or at least more asymptotic terms (as Cipolla 1902 gives for $\pi(n)$)? For extra points: Are Dusart-style absolute error bounds known? Are there better asymptotic -- or better, Shoenfeld-style -- bounds known on the RH? This comes out of comparing the number of n-bit semiprimes to the number predicted by the formula with k = 2, where I noticed what seemed to be a consistent relative (reciprocal density) bias of about 0.5 over the range 15-50 bits.
 2010-08-22, 23:47 #2 wblipp     "William" May 2003 New Haven 2,371 Posts You might try an Li version motivated by comparison to the prime case. When k=1 this is n/log(n), which we know to improved upon by integral (1/log(x)). This can be motivated by the argument that 1/log(x) is correct density. The analogous adjustment would be the integral of $\frac{(\log\log x)^{k-1}}{(k-1)!\log x}$

 Similar Threads Thread Thread Starter Forum Replies Last Post wblipp Math 20 2011-09-07 21:45 Lothar Homework Help 1 2011-03-29 09:23 Random Poster Math 1 2008-12-15 01:14 jasong Math 18 2006-03-31 03:14 jinydu Miscellaneous Math 7 2006-01-21 20:58

All times are UTC. The time now is 12:35.

Tue Jul 5 12:35:13 UTC 2022 up 82 days, 10:36, 1 user, load averages: 1.10, 1.32, 1.38