You are here

A Short Proof of Chebychev's Upper Bound

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.
Old Node ID: 
3470
MSC Codes: 
11A41
Author(s): 
Kimberly Robertson (University of Mississippi) and William Staton (University of Mississippi)
Publication Date: 
Thursday, March 25, 2010
Original Publication Source: 
Mathematics Magazine
Original Publication Date: 
December, 2005
Subject(s): 
Primes
Number Theory
Algebra and Number Theory
Topic(s): 
Primes and Composites
Flag for Digital Object Identifier: 
Publish Page: 
Furnished by JSTOR: 
Rating Count: 
70.00
Rating Sum: 
206.00
Rating Average: 
2.94
Applicable Course(s): 
4.3 Number Theory
Modify Date: 
Friday, August 24, 2012
Average: 3 (70 votes)

Dummy View - NOT TO BE DELETED