Search Classroom Capsules and Notes:
Classroom Capsules and Notes
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:
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.
Capsule Course Topic(s): Number Theory | Primes and Composites
To rate this capsule on a 1-5 scheme, click on the appropriate icosahedron: