A Proof for Prime Numbers

361 Views Asked by At

Show that among k-digit numbers, one in about every 2.3k is a prime.

How can we prove this question? Thanks.

2

There are 2 best solutions below

0
On BEST ANSWER

$10^k\le x < 10^{k+1}\implies \ln 10^k\le \ln x < \ln 10^{k+1}\implies$ $k\ln 10\le\ln x<(k+1)\ln 10$, where $ln 10\approx2,3$.

4
On

Try using the prime number theorem! :)