Timeline for Difficulty with "A new elementary proof of the Prime Number Theorem" by Richter

11 events

when toggle format	what		by	license	comment
7 hours ago	comment	added	rr_math		If you are interested in the answer to the question In the comments you can check it up there: mathoverflow.net/questions/484247/…. Thanks again to @conrad for the help
7 hours ago	comment	added	Conrad		put the answer for that
8 hours ago	comment	added	rr_math		thank you in advance
8 hours ago	comment	added	rr_math		Since you are already familiar with the paper, if you don't mind giving me an hand with another part of it, I have some doubt about the proof of proposition 3.1. In particular, when he estimates the number of primes in $$(\frac{8^x}{2^{n+1}},\frac{8^x}{2^n})$$. I'm not sure if the estimations is right to begin with, cause the application of the lemma itself would give a different bound
Dec 12 at 21:26	vote	accept	rr_math
Dec 12 at 15:54	history	edited	Conrad	CC BY-SA 4.0	added 987 characters in body
Dec 12 at 15:41	history	edited	Conrad	CC BY-SA 4.0	added 987 characters in body
Dec 12 at 15:36	history	edited	Conrad	CC BY-SA 4.0	added 987 characters in body
Dec 12 at 11:12	comment	added	rr_math		i understand your answer but still I'm not 100% sure about this identity $$O(\epsilon^2 8^n/n)+\epsilon^{-3}o(\epsilon^4 8^n/n)=o(\epsilon 8^n/(2n)).$$ If it doesn't bother you could explain to me how did you get the RHS from the LHS?. @conrad
Dec 11 at 6:13	vote	accept	rr_math
Dec 12 at 11:12
Dec 10 at 17:42	history	answered	Conrad	CC BY-SA 4.0