- #1

- 113

- 1

theorem 10: pi[x] >= loglog x

where pi[x] is the prime counting function

and >= stands for greater than or equal to

The arguments written in the book are very compact.please help .

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter AlbertEinstein
- Start date

- #1

- 113

- 1

theorem 10: pi[x] >= loglog x

where pi[x] is the prime counting function

and >= stands for greater than or equal to

The arguments written in the book are very compact.please help .

- #2

shmoe

Science Advisor

Homework Helper

- 1,992

- 1

Do you understand how they derived [tex]p_{n}<2^{2^n}[/tex] ?

this is an important step. The rest just follows from pi(x) being increasing, and also [tex]\pi(p_n)=n[/tex] which they use but don't explicitly mention.

- #3

CRGreathouse

Science Advisor

Homework Helper

- 2,820

- 0

Bertrand's postulate?

- #4

shmoe

Science Advisor

Homework Helper

- 1,992

- 1

Share: