Another Proof of the Infinitude of Primers

Harris, V. C.

doi:10.2307/2309559

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In his book The book of prime number records, Paulo Ribenboim [7] cited nine and a half proofs of this theorem. For other beautiful proofs, see [41][42][43][44][45][46][47][48][49][50][51][52][53][54][55].…”

Section: A Brief Introduction About Euclid's Numbertheoretical Workmentioning

confidence: 99%

Euclid's Number-Theoretical Work

Zhang

2009

Preprint

View full text Add to dashboard Cite

When people mention the mathematical achievements of Euclid, his geometrical achievements always spring to mind. But, his Number-Theoretical achievements (See Books 7, 8 and 9 in his magnum opus Elements [1]) are rarely spoken. The object of this paper is to affirm the number-theoretical role of Euclid and the historical significance of Euclid's algorithm. It is known that almost all elementary number-theoretical texts begin with Division algorithm. However, Euclid did not do like this. He began his number-theoretical work by introducing his algorithm. We were quite surprised when we began to read the Elements for the first time. Nevertheless, one can prove that Euclid's algorithm is essentially equivalent with the Bezout's equation and Division algorithm. Therefore, Euclid has preliminarily established Theory of Divisibility and the greatest common divisor. This is the foundation of Number Theory. After more than 2000 years, by creatively introducing the notion of congruence, Gauss published his Disquisitiones Arithmeticae in 1801 and developed Number Theory as a systematic science. Note also that Euclid's algorithm implies Euclid's first theorem (which is the heart of 'the uniqueness part' of the fundamental theorem of arithmetic) and Euclid's second theorem (which states that there are infinitely many primes). Thus, in the nature of things, Euclid's algorithm is the most important number-theoretical work of Euclid. For this reason, we further summarize briefly the influence of Euclid's algorithm. Knuth said 'we might call Euclid's method the granddaddy of all algorithms'. Based on our discussion and analysis, it leads to the conclusion Euclid's algorithm is the greatest number-theoretical achievement of the Euclidean age.

show abstract

Section: A Brief Introduction About Euclid's Numbertheoretical Workmentioning

confidence: 99%

Euclid's Number-Theoretical Work

Zhang

2009

Preprint

View full text Add to dashboard Cite

show abstract

“…In his book The book of prime number records [2], Paulo Ribenboim cited nine and a half proofs of Euclid's second theorem. In this paper, we listed the references of fifteen distinct proofs again, see [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17].…”

mentioning

confidence: 99%

On the Infinitude of Some Special Kinds of Primes

Zhang

2009

Preprint

View full text Add to dashboard Cite

The aim of this paper is to try to establish a generic model for the problem that several multivariable number-theoretic functions represent simultaneously primes for infinitely many integral points. More concretely, we introduced briefly the research background-the history and current situation-from Euclid's second theorem to Green-Tao theorem. We analyzed some equivalent necessary conditions that irreducible univariable polynomials with integral coefficients represent infinitely many primes, found new necessary conditions which perhaps imply that there are only finitely many Fermat primes, obtained an analogy of the Chinese Remainder Theorem, generalized Euler's function, the prime-counting function and Schinzel-Sierpinski's Conjecture and so on. Nevertheless, this is only a beginning and it miles to go. We hope that number theorists consider further it.

show abstract

Another Proof of the Infinitude of Primers

Cited by 2 publications

References 0 publications

Euclid's Number-Theoretical Work

Euclid's Number-Theoretical Work

On the Infinitude of Some Special Kinds of Primes

Contact Info

Product

Resources

About