A Low-Level Proof of Chebyshev's Pre-Prime Number Theorem

Publisher： Mathematical Association of America

ISSN： 1930-0980

Source： Mathematics Magazine, Vol.82, Iss.4, 2009-10, pp. : 294-300

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A generalization of the prime number theorem

By Bruckman Paul

International Journal of Mathematical Education in Science and Technology, Vol. 39, Iss. 5, 2008-07 ,pp. : 631-635

Taylor & Francis Ltd

Access to resources Recommend Favorite

Prime Number Generation Based On Pocklington's Theorem

By Papanikolaou A. Yan S.Y.

International Journal of Computer Mathematics, Vol. 79, Iss. 10, 2002-01 ,pp. : 1049-1056

Taylor & Francis Ltd

Access to resources Recommend Favorite

Another Simple Proof of the High Girth, High Chromatic Number Theorem

By Marshall Simon

American Mathematical Monthly, Vol. 115, Iss. 1, 2008-01 ,pp. : 68-70

Mathematical Association of America

Access to resources Recommend Favorite

An elementary proof of the Karush-Kuhn-Tucker theorem in normed linear spaces for problems with a finite number of inequality constraints

By Brezhneva Olga

Optimization, Vol. 60, Iss. 5, 2011-01 ,pp. : 613-618

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Combinatorial Proof of a Theorem of Katsuura

The College Mathematics Journal, Vol. 45, Iss. 5, 2014-11 ,pp. : 365-369

Mathematical Association of America

Access to resources Recommend Favorite