Some information-theoretic computations related to the distribution of prime numbers

Details Some information-theoretic computations related to the distribution of prime numbers Some information-theoretic computations related to the distribution of prime numbers

2007-10-22

arxiv.org/abs/0710.4076v2

Computer Science

Information Theory

10 pages; see also http://pages.cs.aueb.gr/users/yiannisk/

Scientific paper

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: The sum of (log p)/p, taken over all primes p not exceeding n, is asymptotic to log n as n tends to infinity. 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.

Affiliated with

Also associated with

No associations

Rating

Some information-theoretic computations related to the distribution of prime numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some information-theoretic computations related to the distribution of prime numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some information-theoretic computations related to the distribution of prime numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358405