1
$\begingroup$

With the question I made about primes, I noticed people enjoy the subject, so here's another thought: let k be a positive integer; how many primes are there from 1 to k?

There's probably no exact expression for (let's call it) N(k) — and, unlike the other question, asking for $\lim_{k \to \infty} N(k)$ is silly because it's obviously infinity —, so, in a lenient variant of the question, does N(k) asymptotically reach a certain function of k as it becomes larger?

  • 1
    @Bill Dubuque That means the function I called $N$ is called $\pi$, and $\pi(k) \sim\! k / ln \space k$.2011-05-11

2 Answers 2

5

This is the well-known and well-studied prime-counting function, which you can read plenty about on its Wikipedia article.

0

Look up the Prime Number Theorem.