Some Information-Theoretic Computations . . .

Some Information-Theoretic Computations . . . (2008)

by I. Kontoyiannis

Venue:

SUBMITTED TO JORMA RISSANEN’S FESTSCHRIFT VOLUME

User correction supplied by mph

Datum	Value	Source
TITLE	Some Information-Theoretic Computations . . .	user correction
AUTHOR NAME	I. Kontoyiannis	user correction
AUTHOR AFFIL	Department of Informatics, Athens University of Economics and Business, Patission 76, Athens 10434, Greece.	user correction
ABSTRACT	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.	SVM HeaderParse 0.2
YEAR	2008	SVM HeaderParse 0.2
VENUE	SUBMITTED TO JORMA RISSANEN’S FESTSCHRIFT VOLUME	user correction
CITATIONS	17 found	ParsCit 1.0