Translator Disclaimer
November 2017 Sieving for the Primes to Prove Their Infinitude
Hunde Eba
Missouri J. Math. Sci. 29(2): 176-183 (November 2017). DOI: 10.35834/mjms/1513306829

Abstract

We prove the infinitude of prime numbers by the principle of contradiction, that is different from Euclid's proof in a way that it uses an explicit property of prime numbers. A sieve method that applies the inclusion-exclusion principle is used to give the property of the prime numbers in terms of the prime counting function.

Citation

Download Citation

Hunde Eba. "Sieving for the Primes to Prove Their Infinitude." Missouri J. Math. Sci. 29 (2) 176 - 183, November 2017. https://doi.org/10.35834/mjms/1513306829

Information

Published: November 2017
First available in Project Euclid: 15 December 2017

zbMATH: 06905063
MathSciNet: MR3737295
Digital Object Identifier: 10.35834/mjms/1513306829

Subjects:
Primary: 11A41
Secondary: 11N35

Rights: Copyright © 2017 Central Missouri State University, Department of Mathematics and Computer Science

JOURNAL ARTICLE
8 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.29 • No. 2 • November 2017
Back to Top