A Proof of the Infinitude of Prime Numbers

Read the full article

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

This paper presents a new proof of the infinitude of prime numbers, also known commonly as "Euclid's theorem." Grounded in fundamental Set theory, the proof uses the method of contradiction to demonstrate the absurdity of assuming the set of all prime numbers to be finite.

Article activity feed