*Prime Number Theorem* states that \(\displaystyle \pi(x) \sim \frac{x}{\log{x}}\), where \(\displaystyle \pi(x)\) is the number of primes not exceeding \(\displaystyle x\), that is, \(\displaystyle \lim _{x\to \infty }{\frac {\;\pi (x)\;}{\frac {x}{\log(x)}}}=1\). Let \(\displaystyle p_{n}\) be the \(\displaystyle n\)th prime number. Prove that, as a corollary of the Prime Number Theorem, \(\displaystyle p_{n} \sim n\log{n}\), that is, \(\displaystyle p_{n} \to n\log{n}\) as \(\displaystyle n \to \infty\).

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

There are no comments in this discussion.