You are here

A Short Proof of Chebychev's Upper Bound

by Kimberly Robertson (University of Mississippi) and William Staton (University of Mississippi)

This article originally appeared in:
Mathematics Magazine
December, 2005

Subject classification(s): Primes | Number Theory | Algebra and Number Theory
Applicable Course(s): 4.3 Number Theory

The authors provide a proof, accessible to beginning number theory students, of Chebychev`s upper bound on the number of primes no greater than n.

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Capsule Course Topic(s):
Number Theory | Primes and Composites
Average: 3 (70 votes)

Dummy View - NOT TO BE DELETED