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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
