Question

Please see the question below

Answer 1

http://www.amazon.com/Introduction-Theory-Numbers-G-Hardy/dp/0199219869

Answer 2

this is the prime number theorem or at least a part of it
it probably comes early on in the book
unless i am interpreting the question incorrectly
is this a homework assignment?

Answer 3

then i am confused
take a look at the prime number theorem
http://en.wikipedia.org/wiki/Prime_number_theorem

Answer 4

on the other hand if you just have to prove the existence of \(a\) and \(b\) i can't imagine what there is to prove. \(n\log(n)\) is some fixed number, so of course you can always find a \(b\) such that \(p_n<bn\log(n)\)