In this paper, based on prime factorization, an array representation of integers is introduced. Using this representation, the infinitude of prime numbers is proved.

prime numbers, Euclid theorem, fundamental theorem of arithmetic, binary numbers.

Received: November 8, 2020; Accepted: November 21, 2020; Published: February 22, 2021

How to cite this article: Đặng Võ Phúc and Shahid Nawaz, An array representation of integers and its application to Euclid’s theorem, Far East Journal of Mathematical Education 21(1) (2021), 1-5. DOI: 10.17654/ME021010001

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] R. Meštrović, Euclid’s Theorem on the Infinitude of Primes: A Historical Survey of its Proofs (300 B.C.-1700), 2018. arXiv: 1202.3670
[2] J. R. Munkres, Topology, 2nd ed., Pearson Education, Inc., 2000.
[3] P. Ribenboim, The Little Book of Bigger Primes, Springer-Verlag, New York, 2004.
[4] J. Vandehey, A proof of the infinitude of primes via continued fractions, Integer 20 (2020), 1-3.
[5] W. Stein, Elementary Number Theory: Primes, Congruences, and Secrets - A Computational Approach, Springer, 2009.