You can probably slog through it with that level of knowledge, if you’v got a good grasp of summation notation. Here’s one version of the proof: https://www.ma

You can probably slog through it with that level of knowledge, if you’v got a good grasp of summation notation. Here’s one version of the proof: https://www.math.lsu.edu/~mahlburg/teaching/handouts/2014-7230/Selberg-ElemPNT1949.pdf https://www.math.lsu.edu/~mahlburg/teaching/handouts/2014-72... See also: https://www.math.columbia.edu/~goldfeld/ErdosSelbergDispute.pdf https://www.math.columbia.edu/~goldfeld/ErdosSelbergDispute.... https://www.math.columbia.edu/~goldfeld/ErdosSelbergDispute.pdf https://www.math.columbia.edu/~goldfeld/ErdosSelbergDispute.... And, a related, very simple and elementary proof of Chebyschev’s theorem that there is always a prime number between n and 2n: https://en.wikipedia.org/wiki/Proof_of_Bertrand%27s_postulate https://en.wikipedia.org/wiki/Proof_of_Bertrand%27s_postulat...