Asymptotic formula for almost primes

563 Views Asked by At

I have developed a formula for almost primes which is far more accurate asymptotically than Landau's well known

$$\pi_k(n) \sim \left( \frac{n}{\log n} \right) \frac{(\log\log n)^{k-1}}{(k - 1)!}$$

(Landau's is not good for high $n$, whereas the one I have been working on actually gets more accurate the higher $n$ becomes - see here.)

Is this of any significance?

Just out of interest, I have included some plots up to $n=9$:

enter image description here

where actual is green, Landau is blue, & mine is red.

(Note: I have changed the scale in each one.)

1

There are 1 best solutions below

11
On BEST ANSWER

Yes, this is of significance. Why don't you write a paper and submit it to a journal?