- #1

- 784

- 11

I'm reading the Prime number theorem wikipedia page and i'm in part 4 under

**Proof sketch**where sometime down they give in inequality:

x is a natural number, p is for prime's obviously: ##\sum_{x^{1-\epsilon }\geq p\geq x}^{} \log p \geq \sum_{p\leq x}^{} logx##

Where epsilon is any value greater than O. (O is some special value that they use in computer science a lot apparently, I might need to understand this value better to understand this inequality, i'm not sure.

Can somebody help me understand this inequality? C'mon I know there are some really smart people here!