Submitted to Jorma Rissanen’s Festschrift volume (2008)
by
I. Kontoyiannis
@MISC{Kontoyiannis08submittedto,
author = {I. Kontoyiannis},
title = {Submitted to Jorma Rissanen’s Festschrift volume},
year = {2008}
}
We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the following asymptotic result, p≤n log p p ∼ log n, as n → ∞, where the sum is over all primes p not exceeding n. We also give finite-n bounds refining the above limit. This result, originally proved by Chebyshev in 1852, is closely related to the celebrated prime number theorem.
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2010 The Pennsylvania State University
