Asymptotic density of k-almost primes

CRGreathouse · 2010-08-16, 20:12

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.

wblipp · 2010-08-22, 23:47

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}$

2010-08-16, 20:12	#1
CRGreathouse Aug 2006 5979₁₀ 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.

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Prime Density Correction Terms?	wblipp	Math	20	2011-09-07 21:45
Asymptotic properties of Aliquot sequences	Lothar	Homework Help	1	2011-03-29 09:23
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
Asymptotic Behavior of a Differential Equation	jinydu	Miscellaneous Math	7	2006-01-21 20:58

2010-08-22, 23:47	#2
wblipp "William" May 2003 New Haven 100100111110₂ 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}$