Related papers: Euclid's Number-Theoretical Work

Euclids algorithm is widely used in calculating of GCD (Greatest Common Divisor) of two positive numbers. There are various fields where this division is used such as channel coding, cryptography, and error correction codes. This makes the…

In this paper, we propose that 'embodied mathematics' should be studied not only by reduction to the present individual bodily experience but in an historical context as well, as far as the origins of mathematics are concerned. Some early…

I introduced the notion of an elliptic group in [Elliptic groups and rings. Beitr\"age zur Algebra und Geometrie 66(2), 497-529]. It is a quasi-group based on the tangent-chord law of elliptic curves and thus, becomes an abelian group upon…

We explore the relationship between Brouwer's intuitionistic mathematics and Euclidean geometry. Brouwer wrote a paper in 1949 called "The contradictority of elementary geometry". In that paper, he showed that a certain classical…

Dirichlet's proof of infinitely many primes in arithmetic progressions was published in 1837, introduced L-series for the first time, and it is said to have started rigorous analytic number theory. Dirichlet uses Euler's earlier work on the…

We show that Fermat's last theorem and a combinatorial theorem of Schur on monochromatic solutions of $a+b=c$ implies that there exist infinitely many primes. In particular, for small exponents such as $n=3$ or $4$ this gives a new proof of…

Higher-order correlation functions are firmly established as a fundamental tool for the statistical analysis of clustering in modern galaxy surveys. It was demonstrated that they greatly enrich the information content extracted by two-point…

We review Euler's work on spherical geometry. After an introduction concerning the general place that trigonometric formulae occupy in geometry, we start by the two memoirs of Euler on spherical trigonometry, in which he establishes the…

Ancient astronomers faced the problem of dealing with arcs and angles in their observations and predictions without the help of modern trigonometry. The usual method to deal with such problems was the Menelaus Theorem, explicitly discussed…

Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits --- a value mathematicians had been competing to determine since Leibniz's astonishing discovery that…

We present a quantum algorithm solving the greatest common divisor (GCD) problem. This quantum algorithm possesses similar computational complexity with classical algorithms, such as the well-known Euclidean algorithm for GCD. This…

In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…

Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.

In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of…

We re-derive Thales, Pythagoras, Apollonius, Stewart, Heron, al Kashi, de Gua, Terquem, Ptolemy, Brahmagupta and Euler's theorems as well as the inscribed angle theorem, the law of sines, the circumradius, inradius and some angle bisector…

The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the…

Lenstra's concept of Euclidean ideals generalizes the Euclidean algorithm; a domain with a Euclidean ideal has cyclic class group, while a domain with a Euclidean algorithm has trivial class group. This paper generalizes Harper's variation…

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

The study of computability has its origin in Hilbert's conference of 1900, where an adjacent question, to the ones he asked, is to give a precise description of the notion of algorithm. In the search for a good definition arose three…

Number theory as a coherent mathematical subject started with the work of Fermat in the decade from 1630 to 1640, but modern number theory, that is, the systematic and mathematically rigorous development of the subject from fundamental…