## The Fundamental Theorem of Arithmetic and Euclid’s Theorem

I encounter a circular argument in the proofs of Euclid’s theorem on the infinitude of primes that rely on the Fundamental Theorem of Arithmetic for natural numbers. We discover this by carefully observing the set of primes involved in the statement.

I am aware that I am making a serious claim here; so I would not be surprised if one rejects the claim immediately. But if you are open and would like to read the article, please download and read:

On the Fundamental Theorem of Arithmetic and Euclid’s Theorem

Please let me know where I am mistaken, if you think that there is a mistake in my reasoning.

Tags: circular argument, circular reasoning, Euclid's Theorem, Fundamental Theorem of Arithmetic, natural numbers, primes